Proving strong duality for geometric optimization using a conic formulation

DOI10.1023/A:1013357600036MaRDI QIDQ5959331zbMATH OpenOpenAlexFDO

Authors François Glineur

Publication date 26 March 2002

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1013357600036

zbMATH Keywords

conic optimizationduality theorygeometric optimizaion

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Review text

The author presents new simplified proofs of the duality theorems of geometric programming using a conic formulation. Section 2 introduces convex cones and conic optimization problem and presefts the properties of the convex cones introduced. In section 3 the author presents a conic formulation of the geometric programming problem. Section 4 presents proofs of the duality results valid for the geometric programming problem, based on the results proved in section 2. Section 5 contains the concluding remarks.

Recommendations

• An extended conic formulation for geometric optimization
• scientific article; zbMATH DE number 3971598
• Fenchel-Lagrange duality versus geometric duality in convex optimization
• scientific article; zbMATH DE number 3936956
• An alternative approach to the refined duality theory of geometric programming

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)