Optimization Online


Complementarity Formulations of l0-norm Optimization Problems

Mingbin Feng (mingbinfeng2011***at***u.northwestern.edu)
John E Mitchell (mitchj***at***rpi.edu)
Jong-Shi Pang (jongship***at***usc.edu)
Xin Shen (shenx5***at***rpi.edu)
Andreas Wächter (andreas.waechter***at***northwestern.edu)

Abstract: In a number of application areas, it is desirable to obtain sparse solutions. Minimizing the number of nonzeroes of the solution (its l0-norm) is a difficult nonconvex optimization problem, and is often approximated by the convex problem of minimizing the l1-norm. In contrast, we consider exact formulations as mathematical programs with complementarity constraints and their reformulations as smooth nonlinear programs. We discuss properties of the various formulations and their connections to the original l0-minimization problem in terms of stationarity conditions, as well as local and global optimality. Numerical experiments using randomly generated problems show that standard nonlinear programming solvers, applied to the smooth but nonconvex equivalent reformulations, are often able to find sparser solutions than those obtained by the convex l1-approximation.

Keywords: l0-norm minimization, complementarity constraints, nonlinear programming

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Category 2: Complementarity and Variational Inequalities


Download: [PDF]

Entry Submitted: 09/24/2013
Entry Accepted: 09/24/2013
Entry Last Modified: 03/06/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society