Some further duality theorems for optimization problems with reverse convex constraint sets

DOI10.1016/0022-247X(92)90385-QzbMath0770.49021MaRDI QIDQ1206958

Ivan Singer

Publication date: 1 April 1993

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

Mathematics Subject Classification ID

Duality theory (optimization) (49N15)

Related Items (max. 100)

Lagrangian duality theorems for reverse convex infimization ⋮ Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation ** ⋮ Necessary and sufficient global optimality conditions for convex maximization revisited ⋮ Optimality Conditions for the Minimization of Quadratic 0-1 Problems ⋮ A new necessary and sufficient global optimality condition for canonical DC problems ⋮ DC programming: overview. ⋮ Duality theorems for quasiconvex programming with a reverse quasiconvex constraint ⋮ Optimality conditions and duality for DC programming in locally convex spaces

Cites Work

• Extremal structure of convex sets. II
• Abstract study of optimality conditions
• Mathematical programs with a two-dimensional reverse convex constraint
• Optimization by level set methods vi:generalizations of surrogate type reverse convex duality
• Minimization of continuous convex functional on complements of convex subsets of locally convex spaces¹
• On $\Phi $-Convexity in Extremal Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some further duality theorems for optimization problems with reverse convex constraint sets