Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation **

DOI10.1080/02331939908844436zbMath0941.49020OpenAlexW2013655535MaRDI QIDQ4265526

Ivan Singer

Publication date: 7 August 2000

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

duality theoryquasi-convexityfarthest pointabstract optimization problems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Duality theory (optimization) (49N15)

Related Items

Zero duality gap conditions via abstract convexity ⋮ Best approximation by normal and conormal sets

Cites Work

• Unnamed Item
• Unnamed Item
• Conjugaison par tranches
• Some relations between dualities, polarities, coupling functionals, and conjugations
• Maximization of lower semi-continuous convex functionals on bounded subsets of locally convex spaces. I: Hyperplane theorems
• The distance to a polyhedron
• Some further duality theorems for optimization problems with reverse convex constraint sets
• Diewert-Crouzeix conjugation for general quasiconvex duality and applications
• Optimization by level set methods vi:generalizations of surrogate type reverse convex duality
• Conjugaison par tranches et dualitë de toland
• Minimization of continuous convex functional on complements of convex subsets of locally convex spaces¹
• Global Optimality Criterion and a Duality with a Zero Gap in Nonconvex Optimization
• A Nonconvex Duality with Zero Gap and Applications
• Some characterizations of surrogate dual problems