An improved algorithm for the \(L_2-L_p\) minimization problem

DOI10.1007/s10107-016-1107-2zbMath1386.90146OpenAlexW2586529239MaRDI QIDQ1683685

Simai He, Rongchuan He, Dong-Dong Ge

Publication date: 1 December 2017

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-016-1107-2

zbMATH Keywords

nonsmooth optimizationnonconvex optimizationcomplexity analysisbridge regression

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Iterative positive thresholding algorithm for non-negative sparse optimization ⋮ An interior stochastic gradient method for a class of non-Lipschitz optimization problems ⋮ Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis ⋮ A gradient descent based algorithm for \(\ell_p\) minimization ⋮ Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model

Cites Work

• Unnamed Item
• Unnamed Item
• A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
• A note on the complexity of \(L _{p }\) minimization
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• On the complexity of approximating a KKT point of quadratic programming
• Asymptotics for Lasso-type estimators.
• Asymptotic properties of bridge estimators in sparse high-dimensional regression models
• Complexity of unconstrained \(L_2 - L_p\) minimization
• Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
• Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
• An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• Restricted isometry properties and nonconvex compressive sensing
• `` Strong NP-Completeness Results
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• A Statistical View of Some Chemometrics Regression Tools
• Sparse Approximate Solutions to Linear Systems