Duality gap of the conic convex constrained optimization problems in normed spaces
From MaRDI portal
Publication:1013974
DOI10.1007/s10107-008-0207-zzbMath1172.90012MaRDI QIDQ1013974
Publication date: 24 April 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0207-z
90C25: Convex programming
90C30: Nonlinear programming
90C31: Sensitivity, stability, parametric optimization
Related Items
Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem, Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs, Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming, Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some convex programs without a duality gap
- A minimax theorem for vector-valued functions
- Zero duality gaps in infinite-dimensional programming
- Optimization and stability results through cone lower semicontinuity
- Convex analysis and nonlinear optimization. Theory and examples
- Existence of optimal solutions and duality results under weak conditions
- A constraint qualification for convex programming
- Duality gap in convex programming
- On strong and total Lagrange duality for convex optimization problems
- The strong conical hull intersection property for convex programming
- An alternative formulation for a new closed cone constraint qualification
- Semidefinite Programming
- Convex Analysis