A convex-like duality scheme for quasi-convex programs

DOI10.1007/BF01582050zbMath0606.49009MaRDI QIDQ3744776

Ury Passy, Eliezer Z. Prisman

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

duality gap; quasiconvex functions; weak and strong duality theorems; Lagrangian; symmetric duality scheme

Mathematics Subject Classification ID

90C25: Convex programming

49N15: Duality theory (optimization)

26B25: Convexity of real functions of several variables, generalizations

Related Items

A Fourth bibliography of fractional programming, A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions], What is quasiconvex analysis?, A duality approach to minimax results for quasi-saddle functions in finite dimensions, Diewert-Crouzeix conjugation for general quasiconvex duality and applications, Efficiency estimation and duality theory for nonconvex technologies, Weak lower subdifferentials and applications, Quasiconvex duality theory by generalized conjugation methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conjugacy in quasi-convex programming
• Some new applications of the Fenchel-Rockafellar duality theorem: Lagrange multiplier theorems and hyperplane theorems for convex optimization and best approximation
• Optimization by level set methods. IV: Generalizations and complements
• Duality theorems for certain programs involving minimum or maximum operations
• Programming with linear fractional functionals
• Maximal Separation Theorems for Convex Sets
• Convex Analysis
• Quasi-Convex Programming
• A Review of Quasi-Convex Functions
• Surrogate Mathematical Programming
• The Generalized Penalty-Function/Surrogate Model