## Abstract

We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ∞]. Several practical algorithms have been proposed to solve this problem. However, none of them has a known polynomial time complexity. In this paper, we transform the problem into standard conic form. Unlike those in most convex optimization problems, the cone for the p-norm problem is not self-dual unless p = 2. Nevertheless, we are able to construct two logarithmically homogeneous self-concordant barrier functions for this problem. The barrier parameter of the first barrier function does not depend on p. The barrier parameter of the second barrier function increases with p. Using both barrier functions, we present a primal-dual potential reduction algorithm to compute an ∈-optimal solution in polynomial time that is independent of p. Computational experiences with a Matlab implementation are also reported.

Original language | English (US) |
---|---|

Pages (from-to) | 551-579 |

Number of pages | 29 |

Journal | SIAM Journal on Optimization |

Volume | 10 |

Issue number | 2 |

DOIs | |

State | Published - Dec 1999 |

Externally published | Yes |

## Keywords

- Facilities location
- Minimizing a sum of norms
- Polynomial time algorithms
- Primal-dual potential reduction algorithms
- Shortest network under a given topology
- Steiner minimum trees

## ASJC Scopus subject areas

- Software
- Theoretical Computer Science