Proving strong duality for geometric optimization using a conic formulation
From MaRDI portal
Recommendations
Cited in
(13)- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- On a compound duality classification for geometric programming
- The decompositions with respect to two core non-symmetric cones
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- An extended conic formulation for geometric optimization
- scientific article; zbMATH DE number 3936956 (Why is no real title available?)
- On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization
- A strong dual for conic mixed-integer programs
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Lagrangian duality in convex conic programming with simple proofs
- Novel constructions for closed convex cones through inequalities and support functions
- Conic formulation for l_p-norm optimization
- An interior-point method for the single-facility location problem with mixed norms using a conic formulation
This page was built for publication: Proving strong duality for geometric optimization using a conic formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959331)