Optimality conditions and duality for DC programming in locally convex spaces

DOI10.1155/2009/258756zbMath1173.49022WikidataQ59219999 ScholiaQ59219999MaRDI QIDQ1035476

Xian-Yun Wang

Publication date: 3 November 2009

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130816

zbMATH Keywords

optimality conditions; strong duality; locally convex Hausdorff topological vector spaces

Mathematics Subject Classification ID

49N15: Duality theory (optimization)

49K27: Optimality conditions for problems in abstract spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
• A general theory of dual optimization problems
• Concave duality: Application to problems dealing with difference of functions
• Some further duality theorems for optimization problems with reverse convex constraint sets
• Duality in D. C. programming: The case of several D. C. constraints
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• DC programming: overview.
• A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
• Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
• Variational Analysis
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs