On duality gap in linear conic problems
From MaRDI portal
Recommendations
- Universal duality in conic convex optimization
- On duality theory of conic linear problems.
- Duality gap in convex programming
- Duality gap of the conic convex constrained optimization problems in normed spaces
- Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- A note on d-stability of convex programs and limiting Lagrangians
- Convex Analysis
- On Zero Duality Gap and the Farkas Lemma for Conic Programming
Cited in
(9)- An exact explicit dual for the linear copositive programming problem
- On Zero Duality Gap and the Farkas Lemma for Conic Programming
- Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces
- scientific article; zbMATH DE number 7201315 (Why is no real title available?)
- Preprocessing and regularization for degenerate semidefinite programs
- Revisiting some rules of convex analysis
- A new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier rule
- Descent methods with computational errors in Banach spaces
- On duality theory of conic linear problems.
This page was built for publication: On duality gap in linear conic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691369)
