Abstract
In this paper, we formulate the l p -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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Peterson, E.L., and Ecker, J.G., Geometric Programming:Duality in Quadratic Programming and l p -Approximation, I, Proceedings of the International Symposium on Mathematical Programming, Edited by H. W. Kuhn and A. W. Tucker, Princeton University Press, Princeton, New Jersey, pp. 445-480, 1970.
Peterson, E.L., and Ecker, J.G., Geometric Programming: Duality in Quadratic Programming and l p -Approximation, II, SIAM Journal on Applied Mathematics, Vol. 13, pp. 317-340, 1967.
Peterson, E.L., and Ecker, J.G., Geometric Programming: Duality in Quadratic Programming and l p -Approximation, III, Journal of Mathematical Analysis and Applications, Vol. 29, pp. 365-383, 1970.
Terlaky, T., On l p -Programming, European Journal of Operational Research, Vol. 22, pp. 70-100, 1985.
Nesterov, Y.E., and Nemirovski, A.S., Interior-Point Polynomial Methods in Convex Programming, SIAM Studies in Applied Mathematics, SIAM Publications, Philadelphia, Pennsylvania, 1994.
Glineur, F., Topics in Convex Optimization: Interior-Point Methods, Conic Duality, and Approximations, PhD Thesis, Faculté Polytechnique de Mons, Mons, Belgium, 2001.
Stoer, J., and Witzgall, C., Convexity and Optimization in Finite Dimensions, I, Springer Verlag, Berlin, Germany, 1970.
Sturm, J.F., Primal-Dual Interior-Point Approach to Semidefinite Programming, PhD Thesis, Erasmus University Rotterdam, Rotterdam, Netherlands, 1997.
Rockafellar, R.T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
Boyd, S., Lobo, M.S., Vandenberghe, L., and Lebret, H., Applications of Second-Order Cone Programming, Linear Algebra and Applications, Vol. 284, pp.193-228, 1998.
Goldman, A.J., and Tucker, A.W., Theory of Linear Programming, Linear Equalities and Related Systems, Edited by H.W. Kuhn and A.W. Tucker, Annals of Mathematical Studies, Princeton University Press, Princeton, New Jersey, Vol. 38, pp. 53-97, 1956.
Xue, G., and Ye, Y., An Efficient Algorithm for Minimizing a Sum of p-Norms, SIAM Journal on Optimization, Vol. 10, pp. 551-579, 2000.
Roos, C., den hertog, D., Jarre, F., and Terlaky, T., A Sufficient Condition for Self-Concordance, with Application to Some Classes of Structured Convex Programming Problems, Mathematical Programming, Vol. 69, pp. 75-88, 1995.
Glineur, F., Proving Strong Duality for Geometric Optimization Using a Conic Formulation, Annals of Operations Research, Vol. 105, pp. 155-184, 2001.
Glineur, F., An Extended Conic Formulation for Geometric Optimization, Foundations of Computing and Decision Sciences, Vol. 25, pp. 161-174, 2000.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Glineur, F., Terlaky, T. Conic Formulation for l p -Norm Optimization. Journal of Optimization Theory and Applications 122, 285–307 (2004). https://doi.org/10.1023/B:JOTA.0000042522.65261.51
Issue Date:
DOI: https://doi.org/10.1023/B:JOTA.0000042522.65261.51