A convex-like duality scheme for quasi-convex programs
From MaRDI portal
Publication:3744776
DOI10.1007/BF01582050zbMath0606.49009OpenAlexW2090428609MaRDI QIDQ3744776
Publication date: 1985
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582050
Convex programming (90C25) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Duality for quasiconvex minimization over closed convex cones ⋮ Efficiency estimation and duality theory for nonconvex technologies ⋮ Diewert-Crouzeix conjugation for general quasiconvex duality and applications ⋮ Weak lower subdifferentials and applications ⋮ A Fourth bibliography of fractional programming ⋮ Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation ⋮ Evenly convex sets, and evenly quasiconvex functions, revisited ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Quasiconvex duality theory by generalized conjugation methods ⋮ A duality approach to minimax results for quasi-saddle functions in finite dimensions ⋮ What is quasiconvex analysis? ⋮ Projective dualities for quasiconvex problems
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
