Complexity of unconstrained L₂ - L_p minimization
From MaRDI portal
Publication:2436652
DOI10.1007/S10107-012-0613-0zbMATH Open1285.90039OpenAlexW2146944586MaRDI QIDQ2436652FDOQ2436652
Authors: Dongdong Ge, Zizhuo Wang, Yinyu Ye, 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
Recommendations
- A note on the complexity of \(L _{p }\) minimization
- The complexity of constrained min-max optimization
- Complexity bounds for second-order optimality in unconstrained optimization
- scientific article; zbMATH DE number 1546513
- Area-time complexity of the unconstrained minimization problem
- Complexity of linear minimization and projection on some sets
- On an optimization algorithm for \(LC^1\) unconstrained optimization
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- Computational complexity of norm-maximization
- Nonconvex approximations in unconstrained minimization
variable selectionnonconvex optimizationnonsmooth optimizationbridge estimatorsparse solution reconstruction
Cites Work
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotics for Lasso-type estimators.
- A Statistical View of Some Chemometrics Regression Tools
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Title not available (Why is that?)
- Lower bound theory of nonzero entries in solutions of \(\ell_2-\ell_p\) minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Restricted isometry properties and nonconvex compressive sensing
- Sparse Approximate Solutions to Linear Systems
- A note on the complexity of \(L _{p }\) minimization
- Title not available (Why is that?)
- `` Strong NP-Completeness Results
Cited In (75)
- Area-time complexity of the unconstrained minimization problem
- Entropy function-based algorithms for solving a class of nonconvex minimization problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Isotropic non-Lipschitz regularization for sparse representations of random fields on the sphere
- A note on the complexity of \(L _{p }\) minimization
- The complexity results of the sparse optimization problems and reverse convex optimization problems
- Title not available (Why is that?)
- Difference-of-convex learning: directional stationarity, optimality, and sparsity
- Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Penalty methods for a class of non-Lipschitz optimization problems
- Iterative reweighted methods for \(\ell _1-\ell _p\) minimization
- Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
- Rank-one and sparse matrix decomposition for dynamic MRI
- Neural network for a class of sparse optimization with \(L_0\)-regularization
- A generalized Krylov subspace method for \(\ell_p\)-\(\ell_q\) minimization
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
- Sparse solutions of a class of constrained optimization problems
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
- The sparsest solutions to \(Z\)-tensor complementarity problems
- Sparse solutions of linear complementarity problems
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization
- Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model
- A joint matrix minimization approach for multi-image face recognition
- A gradient descent based algorithm for \(\ell_p\) minimization
- Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization
- An interior stochastic gradient method for a class of non-Lipschitz optimization problems
- Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization
- Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone
- Global convergence of proximal iteratively reweighted algorithm
- A sparse optimization problem with hybrid \(L_2\)-\(L_p\) regularization for application of magnetic resonance brain images
- Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
- An improved algorithm for the \(L_2-L_p\) minimization problem
- Note on time bounds of two-phase algorithms for \(L\)-convex function minimization
- Smoothing inertial projection neural network for minimization \(L_{p-q}\) in sparse signal reconstruction
- A note on the smoothing quadratic regularization method for non-Lipschitz optimization
- Approximation hardness for a class of sparse optimization problems
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- On sparse beamformer design with reverberation
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- Optimality and complexity for constrained optimization problems with nonconvex regularization
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
- Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
- \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities
- Title not available (Why is that?)
- A new hybrid \(l_p\)-\(l_2\) model for sparse solutions with applications to image processing
- Non-convex \(\ell_p\) regularization for sparse reconstruction of electrical impedance tomography
- An efficient semismooth Newton method for adaptive sparse signal recovery problems
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
- GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee
- Smoothing strategy along with conjugate gradient algorithm for signal reconstruction
- 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
- A Lagrange-Newton algorithm for sparse nonlinear programming
- Penalty method for the sparse portfolio optimization problem
- Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization
- Title not available (Why is that?)
- An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems
- A reduced half thresholding algorithm
- A Lagrange–Newton algorithm for tensor sparse principal component analysis
- A communication-efficient method for ℓ0 regularization linear regression models
- A smoothing majorization method for \(l^2_2-l^p_p\) matrix minimization
- Optimization conditions and decomposable algorithms for convertible nonconvex optimization
- Hessian barrier algorithms for non-convex conic optimization
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
- Fully polynomial-time randomized approximation schemes for global optimization of high-dimensional minimax concave penalized generalized linear models
- An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model
- 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
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities
This page was built for publication: Complexity of unconstrained \(L_2 - L_p\) minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436652)
