Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
From MaRDI portal
Publication:1756795
DOI10.1007/s10898-018-0675-5zbMath1404.90117arXiv1804.11062OpenAlexW2964192982MaRDI QIDQ1756795
Shujun Bi, Shaohua Pan, Yu-Lan Liu
Publication date: 27 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.11062
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial optimization (90C27) Numerical methods of relaxation type (49M20)
Related Items
A proximal dual semismooth Newton method for zero-norm penalized quantile regression estimator ⋮ Second-order optimality conditions for mathematical program with semidefinite cone complementarity constraints and applications ⋮ 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 ⋮ Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines ⋮ Two relaxation methods for rank minimization problems ⋮ Calmness of partial perturbation to composite rank constraint systems and its applications ⋮ Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation ⋮ Several Classes of Stationary Points for Rank Regularized Minimization Problems ⋮ An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization ⋮ Weighted thresholding homotopy method for sparsity constrained optimization ⋮ Robust tensor recovery with nonconvex and nonsmooth regularization ⋮ Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions ⋮ Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- The Adaptive Lasso and Its Oracle Properties
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Exact penalty and error bounds in DC programming
- Statistics for high-dimensional data. Methods, theory and applications.
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Exact matrix completion via convex optimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation
- Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
- Uncertainty Principles and Signal Recovery
- Implicit Functions and Solution Mappings
- Just relax: convex programming methods for identifying sparse signals in noise
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Optimization and nonsmooth analysis
- Signal Recovery and the Large Sieve
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Rank reduction of correlation matrices by majorization
- Optimality conditions for bilevel programming problems
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Matrix Completion From a Few Entries
- Multistage Convex Relaxation Approach to Rank Regularized Minimization Problems Based on Equivalent Mathematical Program with a Generalized Complementarity Constraint
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
- Model Selection and Estimation in Regression with Grouped Variables
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
- Mathematical Programs with Equilibrium Constraints
