Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces | Zendy

Gang Li | Zendy; Xiaoqi Yang | Zendy; Yuying Zhou | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces

Author(s) -

Gang Li,

Xiaoqi Yang,

Yuying Zhou

Publication year - 2013

Publication title -

journal of industrial and management optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.325

H-Index - 32

eISSN - 1553-166X

pISSN - 1547-5816

DOI - 10.3934/jimo.2013.9.671

Subject(s) - epigraph , duality (order theory) , class (philosophy) , strong duality , lagrangian , mathematics , duality gap , optimization problem , mathematical optimization , convex optimization , convex function , perturbation function , convex analysis , regular polygon , pure mathematics , computer science , geometry , artificial intelligence

By using properties of dualizing parametrization functions, Lagrangian functions and the epigraph technique, some sufficient and necessary conditions of the stable strong duality and strong total duality for a class of DC optimization problems are established.Department of Applied Mathematic

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research