Complexity of unconstrained $L_2 - L_p$ minimization

DOI10.1007/s10107-012-0613-0zbMath1285.90039OpenAlexW2146944586MaRDI QIDQ2436652

Dong-Dong Ge, Yinyu Ye, Zizhuo Wang, Xiaojun Chen

Publication date: 25 February 2014

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

Full work available at URL: https://doi.org/10.1007/s10107-012-0613-0

zbMATH Keywords

nonsmooth optimization nonconvex optimization variable selection bridge estimator sparse solution reconstruction

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)

Related Items

An efficient semismooth Newton method for adaptive sparse signal recovery problems, $S_{1/2}$ regularization methods and fixed point algorithms for affine rank minimization problems, GSDAR: a fast Newton algorithm for $\ell_0$ regularized generalized linear models with statistical guarantee, Iterative thresholding algorithm based on non-convex method for modified $l_p$-norm regularization minimization, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, A smoothing SQP framework for a class of composite $L_q$ minimization over polyhedron, Sparse solutions of linear complementarity problems, Optimization conditions and decomposable algorithms for convertible nonconvex optimization, A smoothing majorization method for matrix minimization, Global optimality condition and fixed point continuation algorithm for non-Lipschitz $\ell_p$ regularized matrix minimization, A joint matrix minimization approach for multi-image face recognition, An interior stochastic gradient method for a class of non-Lipschitz optimization problems, A Generalized Krylov Subspace Method for $\ell_p$-$\ell_q$ Minimization, Smoothing strategy along with conjugate gradient algorithm for signal reconstruction, Global convergence of proximal iteratively reweighted algorithm, Smoothing inertial projection neural network for minimization $L_{p-q}$ in sparse signal reconstruction, Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming, $l_{p}$-norm regularization method ($ 0<p<1 $) and DC programming for correction system of inconsistency linear inequalities, An improved algorithm for the $L_2-L_p$ minimization problem, Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions, Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity, A communication-efficient method for ℓ₀ regularization linear regression models, Neural network for a class of sparse optimization with $L_0$-regularization, Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix, On the convex hull of convex quadratic optimization problems with indicators, A wonderful triangle in compressed sensing, A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities, $\ell _p$ regularized low-rank approximation via iterative reweighted singular value minimization, An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems, A reduced half thresholding algorithm, A new hybrid $l_p$-$l_2$ model for sparse solutions with applications to image processing, Linear-step solvability of some folded concave and singly-parametric sparse optimization problems, Global solutions of non-Lipschitz $S_{2}$-$S_{p}$ minimization over the positive semidefinite cone, The complexity results of the sparse optimization problems and reverse convex optimization problems, Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities, Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis, A note on the smoothing quadratic regularization method for non-Lipschitz optimization, Non-convex ℓ_p regularization for sparse reconstruction of electrical impedance tomography, Unnamed Item, The sparsest solutions to $Z$-tensor complementarity problems, Iterative reweighted methods for $\ell _1-\ell _p$ minimization, Optimality conditions for locally Lipschitz optimization with $l_0$-regularization, Penalty Methods for a Class of Non-Lipschitz Optimization Problems, High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms, Unnamed Item, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, A gradient descent based algorithm for $\ell_p$ minimization, Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization, Nonconvex sorted $\ell_1$ minimization for sparse approximation, On sparse beamformer design with reverberation, A constrained optimization reformulation and a feasible descent direction method for $L_{1/2}$ regularization, A sparse optimization problem with hybrid $L_2$-$L_p$ regularization for application of magnetic resonance brain images, Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model, Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming, A Lagrange-Newton algorithm for sparse nonlinear programming, A convex relaxation framework consisting of a primal-dual alternative algorithm for solving $\ell_0$ sparsity-induced optimization problems with application to signal recovery based image restoration, Unnamed Item, Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions, Isotropic non-Lipschitz regularization for sparse representations of random fields on the sphere, An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model ^*, Sparse Solutions of a Class of Constrained Optimization Problems, Rank-one and sparse matrix decomposition for dynamic MRI, Entropy function-based algorithms for solving a class of nonconvex minimization problems, Accelerated gradient methods for nonconvex nonlinear and stochastic programming

Cites Work

Complexity of unconstrained \(L_2 - L_p\) minimization