An improved algorithm for the \(L_2-L_p\) minimization problem
type: Item
instance of: scholarly article
title: An improved algorithm for the \(L_2-L_p\) minimization problem
zbMATH Open document ID: 1386.90146
author: Rongchuan He
author: Simai He
author: Dongdong Ge
published in: Mathematical Programming. Series A. Series B
publication date: 2017-12-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M37
zbMATH DE Number: 6814725
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: bridge regression
zbMATH Keywords: complexity analysis
MaRDI profile type: Publication
full work available at URL: s10107-016-1107-2
OpenAlex ID: W2586529239
cites work: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
cites work: Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization
cites work: Restricted isometry properties and nonconvex compressive sensing
cites work: A note on the complexity of \(L _{p }\) minimization
cites work: Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
cites work: Complexity of unconstrained \(L_2 - L_p\) minimization
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
cites work: A Statistical View of Some Chemometrics Regression Tools
cites work: `` Strong '' NP-Completeness Results
cites work: Q4198056
cites work: Asymptotic properties of bridge estimators in sparse high-dimensional regression models
cites work: Asymptotics for Lasso-type estimators.
cites work: An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
cites work: A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
cites work: Sparse Approximate Solutions to Linear Systems
cites work: Q4258215
cites work: On the complexity of approximating a KKT point of quadratic programming
DOI: 10.1007/S10107-016-1107-2
description: scientific article; zbMATH DE number 6814725