Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
type: Item
instance of: scholarly article
title: Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
zbMATH Open document ID: 1481.65059
author: Peili Li
author: Xiliang Lu
author: Yunhai Xiao
published in: Inverse Problems and Imaging
publication date: 2022-01-26T00:00:00Z
Mathematics Subject Classification ID: 65F22
Mathematics Subject Classification ID: 15A29
zbMATH DE Number: 7464245
zbMATH Keywords: linear inverse problem
zbMATH Keywords: \( \ell^0\)-\(\ell^2\) penalty
zbMATH Keywords: coordinate-wise minimizers
zbMATH Keywords: smoothing Newton method
zbMATH Keywords: global convergence
describes a project that uses: PDCO
describes a project that uses: foba
describes a project that uses: sparsenet
MaRDI profile type: Publication
full work available at URL: ipi.2021044
OpenAlex ID: W3179084939
cites work: A new look at the statistical model identification
cites work: First-Order Methods in Optimization
cites work: Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
cites work: Best subset selection via a modern optimization lens
cites work: A comparison of large scale mixed complementarity problem solvers
cites work: Iterative thresholding for sparse approximations
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Regularization with non-convex separable constraints
cites work: Sharp RIP bound for sparse signal and low-rank matrix recovery
cites work: Decoding by Linear Programming
cites work: Smooth Approximations to Nonlinear Complementarity Problems
cites work: A class of smoothing functions for nonlinear and mixed complementarity problems
cites work: The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
cites work: Atomic decomposition by basis pursuit
cites work: Smoothing methods for nonsmooth, nonconvex minimization
cites work: A parameterized Newton method and a quasi-Newton method for nonsmooth equations
cites work: Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
cites work: Convergence domains of certain iterative methods for solving nonlinear equations
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: Compressed sensing
cites work: Uncertainty principles and ideal atomic decomposition
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing
cites work: A Statistical View of Some Chemometrics Regression Tools
cites work: Q4353536
cites work: Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
cites work: Necessary and sufficient conditions for linear convergence of ℓ1-regularization
cites work: A semismooth Newton method for Tikhonov functionals with sparsity constraints
cites work: Global convergence of damped semismooth Newton methods for ℓ 1 Tikhonov regularization
cites work: A superlinearly convergent \(R\)-regularized Newton scheme for variational models with concave sparsity-promoting priors
cites work: The Mnet method for variable selection
cites work: A unified primal dual active set algorithm for nonconvex sparse recovery
cites work: Q4558147
cites work: Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
cites work: Optimal Control with $L^p(\Omega)$, $p\in [0,1)$, Control Cost
cites work: A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
cites work: Alternating Direction Method of Multipliers for Linear Inverse Problems
cites work: Preconditioned alternating direction method of multipliers for inverse problems with constraints
cites work: Elastic-net regularization: error estimates and active set methods
cites work: Q3813205
cites work: A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
cites work: SparseNet: Coordinate Descent With Nonconvex Penalties
cites work: A new approach to variable selection in least squares problems
cites work: A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations
cites work: Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
cites work: A Tikhonov-based projection iteration for nonlinear ill-posed problems with sparsity con\-straints
cites work: Q4864293
cites work: Convergence of a block coordinate descent method for nondifferentiable minimization
cites work: Multi-parameter Tikhonov regularization with the \(\ell^0\) sparsity constraint
cites work: Nearly unbiased variable selection under minimax concave penalty
cites work: A general theory of concave regularization for high-dimensional sparse estimation problems
cites work: Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
cites work: Regularization and Variable Selection Via the Elastic Net
DOI: 10.3934/IPI.2021044
description: scientific article; zbMATH DE number 7464245