Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Nearly unbiased variable selection under minimax concave penalty
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Iterative hard thresholding methods for $l_0$ regularized convex cone programming
Generalized Hessian matrix and second-order optimality conditions for problems with $C^{1,1}$ data
Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm
On metric and calmness qualification conditions in subdifferential calculus
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Concave programming for minimizing the zero-norm over polyhedral sets
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Convex analysis approach to d. c. programming: Theory, algorithms and applications
Global convergence of ADMM in nonconvex nonsmooth optimization
DC programming and DCA: thirty years of developments
DC formulations and algorithms for sparse optimization problems
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
Generalized subdifferentials of the rank function
A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations
A study of piecewise linear-quadratic programs
Accelerated iterative hard thresholding algorithm for $l_0$ regularized regression problem
A new proximal iterative hard thresholding method with extrapolation for $\ell _0$ minimization
On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
A nonsmooth version of Newton's method
Strong oracle optimality of folded concave penalized estimation
Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation
Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
Computing B-Stationary Points of Nonsmooth DC Programs
Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
Uncertainty Principles and Signal Recovery
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
Square-root lasso: pivotal recovery of sparse signals via conic programming
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
Implicit Functions and Solution Mappings
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Optimization and nonsmooth analysis
Some continuity properties of polyhedral multifunctions
Semismooth and Semiconvex Functions in Constrained Optimization
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
Variational Analysis
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Finite-Dimensional Variational Inequalities and Complementarity Problems
10.1162/153244303322753751
Optimality conditions for bilevel programming problems
Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension
Modern Nonconvex Nondifferentiable Optimization
Dense Error Correction Via $\ell^1$-Minimization
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima
Convex Analysis
Compressed sensing