Equivalent Lipschitz surrogates for zero-norm and rank optimization problems

04/30/2018
by   Yulan Liu, et al.
0

This paper proposes a mechanism to produce equivalent Lipschitz surrogates for zero-norm and rank optimization problems by means of the global exact penalty for their equivalent mathematical programs with an equilibrium constraint (MPECs). Specifically, we reformulate these combinatorial problems as equivalent MPECs by the variational characterization of the zero-norm and rank function, show that their penalized problems, yielded by moving the equilibrium constraint into the objective, are the global exact penalization, and obtain the equivalent Lipschitz surrogates by eliminating the dual variable in the global exact penalty. These surrogates, including the popular SCAD function in statistics, are also difference of two convex functions (D.C.) if the function and constraint set involved in zero-norm and rank optimization problems are convex. We illustrate an application by designing a multi-stage convex relaxation approach to the rank plus zero-norm regularized minimization problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2018

GEP-MSCRA for computing the group zero-norm regularized least squares estimator

This paper concerns with the group zero-norm regularized least squares e...
research
05/06/2012

Convex Relaxation for Combinatorial Penalties

In this paper, we propose an unifying view of several recently proposed ...
research
10/11/2022

Tight Error Bounds for Nonnegative Orthogonality Constraints and Exact Penalties

For the intersection of the Stiefel manifold and the set of nonnegative ...
research
08/31/2010

Penalty Decomposition Methods for L0-Norm Minimization

In this paper we consider general l0-norm minimization problems, that is...
research
10/27/2018

Using Fractional Programming for Zero-Norm Approximation

This paper proposes the use of fractional programming (FP) to solve prob...
research
07/01/2014

DC approximation approaches for sparse optimization

Sparse optimization refers to an optimization problem involving the zero...
research
06/20/2023

Globally optimal solutions to a class of fractional optimization problems based on proximity gradient algorithm

We establish globally optimal solutions to a class of fractional optimiz...

Please sign up or login with your details

Forgot password? Click here to reset