Strong duality for standard convex programs
From MaRDI portal
Publication:2074838
DOI10.1007/s00186-021-00761-xzbMath1489.90118OpenAlexW3216313338MaRDI QIDQ2074838
Kenneth O. Kortanek, Qinghong Zhang, Guolin Yu
Publication date: 11 February 2022
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-021-00761-x
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strong duality and sensitivity analysis in semi-infinite linear programming
- On equating the difference between optimal and marginal values of general convex programs
- Lexocographic multipliers
- Regularizing the abstract convex program
- An exact duality theory for semidefinite programming and its complexity implications
- Constrained extremum problems and image space analysis. I: Optimality conditions
- Constrained extremum problems and image space analysis. II: Duality and penalization
- Constrained extremum problems and image space analysis. III: Generalized systems
- A perturbation view of level-set methods for convex optimization
- On the theory of Lagrangian duality
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Strong Duality for Semidefinite Programming
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Convex Duality and Financial Mathematics
- Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- Convex analysis treated by linear programming
- Perfect duality in semi-infinite and semidefinite programming
This page was built for publication: Strong duality for standard convex programs
