Conic formulation for lp-norm optimization

Glineur, François;Terlaky, Tamas
(2004) Journal of Optimization Theory and Applications — Vol. 122, n° 2, p. 285-307 (2004)

Files

JOTA04.pdf
  • Restricted Access
  • Adobe PDF
  • 160.3 KB

Details

Authors
Abstract
In this paper, we formulate the lp-norm optimization problem as a conic optimization problem, derive its duality properties (weak duality, zero duality gap, and primal attainment) using standard conic duality and show how it can be solved in polynomial time applying the framework of interior-point algorithms based on self-concordant barriers.
Affiliations

Citations

Glineur, F., & Terlaky, T. (2004). Conic formulation for lp-norm optimization. Journal of Optimization Theory and Applications, 122(2), 285-307. https://doi.org/10.1023/B:JOTA.0000042522.65261.51 (Original work published 2004)