Proving strong duality for geometric optimization using a conic formulation
From MaRDI portal
Publication:5959331
DOI10.1023/A:1013357600036zbMath0998.90086OpenAlexW1729600352MaRDI QIDQ5959331
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
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (5)
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ On a compound duality classification for geometric programming ⋮ Conic formulation for \(l_p\)-norm optimization ⋮ An interior-point method for the single-facility location problem with mixed norms using a conic formulation ⋮ The decompositions with respect to two core non-symmetric cones
This page was built for publication: Proving strong duality for geometric optimization using a conic formulation
