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.
McMaster UniversityDepartment of Computing and Software
Citations
APA
Chicago
FWB
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)