Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
From MaRDI portal
Abstract: 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.
Recommendations
- Equivalent Lipschitz optimization model for the group zero-norm regularized problem
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
- Exact penalty decomposition method for zero-norm minimization based on MPEC formulation
- A global exact penalty for rank-constrained optimization problem and applications
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 823379 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6276219 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Consistency of the group Lasso and multiple kernel learning
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Exact matrix completion via convex optimization
- Exact penalty and error bounds in DC programming
- Exact penalty decomposition method for zero-norm minimization based on MPEC formulation
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Implicit Functions and Solution Mappings
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- Just relax: convex programming methods for identifying sparse signals in noise
- Mathematical Programs with Equilibrium Constraints
- Matrix Completion From a Few Entries
- Model Selection and Estimation in Regression with Grouped Variables
- Multistage convex relaxation approach to rank regularized minimization problems based on equivalent mathematical program with a generalized complementarity constraint
- Nearly unbiased variable selection under minimax concave penalty
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Optimality conditions for bilevel programming problems
- Optimization and nonsmooth analysis
- Penalty methods for a class of non-Lipschitz optimization problems
- Rank reduction of correlation matrices by majorization
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Signal Recovery and the Large Sieve
- Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
- Statistics for high-dimensional data. Methods, theory and applications.
- The Adaptive Lasso and Its Oracle Properties
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Uncertainty Principles and Signal Recovery
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(16)- Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
- Estimation of \(l_0\) norm penalized models: a statistical treatment
- Robust tensor completion: equivalent surrogates, error bounds, and algorithms
- Equivalent Lipschitz optimization model for the group zero-norm regularized problem
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
- Two relaxation methods for rank minimization problems
- Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
- Robust tensor recovery with nonconvex and nonsmooth regularization
- Several classes of stationary points for rank regularized minimization problems
- Weighted thresholding homotopy method for sparsity constrained optimization
- A proximal dual semismooth Newton method for zero-norm penalized quantile regression estimator
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
- Calmness of partial perturbation to composite rank constraint systems and its applications
This page was built for publication: Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756795)
