Lagrangian duality theorems for reverse convex infimization

DOI10.1080/01630560008816995zbMath0986.90072OpenAlexW2012077879MaRDI QIDQ4528559

Ivan Singer

Publication date: 5 June 2002

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630560008816995

zbMATH Keywords

Lagrangian dualitysurrogate dualityreverse convex problems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)

Related Items (1)

Duality theorems for quasiconvex programming with a reverse quasiconvex constraint

Cites Work

• Unnamed Item
• Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems
• Generalizations of methods of best approximation to convex optimization in locally convex spaces. II: hyperbolic theorems
• Some further duality theorems for optimization problems with reverse convex constraint sets
• Optimization by level set methods vi:generalizations of surrogate type reverse convex duality
• Some new applications of the Fenchel-Rockafellar duality theorem: Lagrange multiplier theorems and hyperplane theorems for convex optimization and best approximation
• Minimization of continuous convex functional on complements of convex subsets of locally convex spaces¹
• Extension with larger norm and separation with double support in normed linear spaces
• Duality in Reverse Convex Optimization

This page was built for publication: Lagrangian duality theorems for reverse convex infimization