Optimization by level set methods vi:generalizations of surrogate type reverse convex duality

DOI10.1080/02331938708843264zbMath0638.49006OpenAlexW2005169870MaRDI QIDQ3779318

Ivan Singer

Publication date: 1987

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

level setssurrogate dualitysurrogate constraintperturbation multifunctionreverse convex infimization

Mathematics Subject Classification ID

Programming in abstract spaces (90C48) Duality theory (optimization) (49N15) Optimality conditions for problems in abstract spaces (49K27)

Related Items (4)

Lagrangian duality theorems for reverse convex infimization ⋮ Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation ** ⋮ Some further duality theorems for optimization problems with reverse convex constraint sets ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Global minimization of a concave function subject to mixed linear and reverse convex constraints
• Surrogate dual problems and surrogate Lagrangians
• A general theory of dual optimization problems
• A general theory of surrogate dual and perturbational extended surrogate dual optimization problems
• Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems
• Minimization of continuous convex functional on complements of convex subsets of locally convex spaces¹
• Optimization by level set methods. III: Characterizations of solutions in the presence of duality
• Optimization by level set methods. IV: Generalizations and complements
• On $\Phi $-Convexity in Extremal Problems
• Extension with larger norm and separation with double support in normed linear spaces

This page was built for publication: Optimization by level set methods vi:generalizations of surrogate type reverse convex duality