Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
From MaRDI portal
Publication:2072164
DOI10.3934/ipi.2021044zbMath1481.65059OpenAlexW3179084939MaRDI QIDQ2072164
Xiliang Lu, Peili Li, Yun-hai Xiao
Publication date: 26 January 2022
Published in: Inverse Problems and Imaging (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/ipi.2021044
global convergencelinear inverse problemsmoothing Newton method\( \ell^0\)-\(\ell^2\) penaltycoordinate-wise minimizers
Ill-posedness and regularization problems in numerical linear algebra (65F22) Inverse problems in linear algebra (15A29)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nearly unbiased variable selection under minimax concave penalty
- Best subset selection via a modern optimization lens
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
- Smoothing methods for nonsmooth, nonconvex minimization
- Iterative thresholding for sparse approximations
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- A parameterized Newton method and a quasi-Newton method for nonsmooth equations
- A comparison of large scale mixed complementarity problem solvers
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- A unified primal dual active set algorithm for nonconvex sparse recovery
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors
- A Tikhonov-based projection iteration for nonlinear ill-posed problems with sparsity con\-straints
- Atomic Decomposition by Basis Pursuit
- Multi-parameter Tikhonov regularization with the ℓ 0 sparsity constraint
- Preconditioned alternating direction method of multipliers for inverse problems with constraints
- Necessary and sufficient conditions for linear convergence of ℓ1-regularization
- SparseNet: Coordinate Descent With Nonconvex Penalties
- Regularization with non-convex separable constraints
- A semismooth Newton method for Tikhonov functionals with sparsity constraints
- Decoding by Linear Programming
- Elastic-net regularization: error estimates and active set methods
- Convergence domains of certain iterative methods for solving nonlinear equations
- Smooth Approximations to Nonlinear Complementarity Problems
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- A new approach to variable selection in least squares problems
- Uncertainty principles and ideal atomic decomposition
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
- A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing
- First-Order Methods in Optimization
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A Statistical View of Some Chemometrics Regression Tools
- A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
- Global convergence of damped semismooth Newton methods for ℓ 1 Tikhonov regularization
- Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
- Regularization and Variable Selection Via the Elastic Net
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Optimal Control with $L^p(\Omega)$, $p\in [0,1)$, Control Cost
- The Mnet method for variable selection
- Alternating Direction Method of Multipliers for Linear Inverse Problems
- Compressed sensing
- Convergence of a block coordinate descent method for nondifferentiable minimization
- A general theory of concave regularization for high-dimensional sparse estimation problems
- A new look at the statistical model identification
