Duality theorems for separable convex programming without qualifications
From MaRDI portal
Publication:2359787
DOI10.1007/s10957-016-1003-1zbMath1380.90222OpenAlexW2512316777MaRDI QIDQ2359787
Satoshi Suzuki, Daishi Kuroiwa
Publication date: 22 June 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-016-1003-1
quasiconvex functionduality theoremLagrange dualityseparable convex programmingcnstraint qualification
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Convexity of real functions of several variables, generalizations (26B25)
Related Items (4)
Duality theorems for convex and quasiconvex set functions ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Characterizations of the solution sets of generalized convex fuzzy optimization problem
Cites Work
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Necessary and sufficient constraint qualification for surrogate duality
- New strong duality results for convex programs with separable constraints
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- On set containment characterization and constraint qualification for quasiconvex programming
- Subdifferential calculus for a quasiconvex function with generator
- Farkas' lemma for separable sublinear inequalities without qualifications
- New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
- Some convex programs without a duality gap
- Some constraint qualifications for quasiconvex vector-valued systems
- Surrogate duality for robust optimization
- On strong and total Lagrange duality for convex optimization problems
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- An alternative formulation for a new closed cone constraint qualification
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Quasiconvex duality theory by generalized conjugation methods
- On Quasi-Convex Duality
- Unnamed Item
This page was built for publication: Duality theorems for separable convex programming without qualifications
