An efficient algorithm for minimizing a sum of p-norms

Guoliang Xue, Yinyu Ye

Research output: Contribution to journalArticle

39 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)551-579
Number of pages29
JournalSIAM Journal on Optimization
Volume10
Issue number2
StatePublished - 1999
Externally publishedYes

Fingerprint

Barrier Function
Efficient Algorithms
Norm
Polynomials
Convex optimization
Polynomial-time Complexity
Primal-dual
Cones
Convex Optimization
MATLAB
Polynomial time
Cone
Optimal Solution
Transform
Optimization Problem
Interval

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

  • Mathematics(all)
  • Applied Mathematics

Cite this

An efficient algorithm for minimizing a sum of p-norms. / Xue, Guoliang; Ye, Yinyu.

In: SIAM Journal on Optimization, Vol. 10, No. 2, 1999, p. 551-579.

Research output: Contribution to journalArticle

@article{37d4b28183d84afc9e902268a84b43d0,
title = "An efficient algorithm for minimizing a sum of p-norms",
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.",
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",
author = "Guoliang Xue and Yinyu Ye",
year = "1999",
language = "English (US)",
volume = "10",
pages = "551--579",
journal = "SIAM Journal on Optimization",
issn = "1052-6234",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "2",

}

TY - JOUR

T1 - An efficient algorithm for minimizing a sum of p-norms

AU - Xue, Guoliang

AU - Ye, Yinyu

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

KW - Facilities location

KW - Minimizing a sum of norms

KW - Polynomial time algorithms

KW - Primal-dual potential reduction algorithms

KW - Shortest network under a given topology

KW - Steiner minimum trees

UR - http://www.scopus.com/inward/record.url?scp=0011032427&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0011032427&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0011032427

VL - 10

SP - 551

EP - 579

JO - SIAM Journal on Optimization

JF - SIAM Journal on Optimization

SN - 1052-6234

IS - 2

ER -