Subspace Newton method for sparse group _0 optimization problem

DOI10.1007/S10898-024-01396-YMaRDI QIDQ6607024zbMATH OpenFDO

Authors Shichen Liao, Congying Han, Tiande Guo, Bonan Li

Publication date 17 September 2024

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10898-024-01396-Y

zbMATH Keywords

global convergencesecond-order convergence ratesparse group \(\ell_0\) optimizationsubspace Newton method

Mathematics Subject Classification ID

Newton-type methods (49M15) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
• Proximal variable metric method with spectral diagonal update for large scale sparse optimization
• A new piecewise quadratic approximation approach for \(L_0\) norm minimization problem
• Newton-type methods with the proximal gradient step for sparse estimation
• Newton method for \(\ell_0\)-regularized optimization

Cites work

• A continuous exact _0 penalty (CEL0) for least squares regularized problem
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A method for finding structured sparse solutions to nonnegative least squares problems with applications
• A selective review of group selection in high-dimensional models
• A variational approach to sparsity optimization based on Lagrange multiplier theory
• An active set Barzilar-Borwein algorithm for \(l_0\) regularized optimization
• An application of sparse-group Lasso regularization to equity portfolio optimization and sector selection
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Best subset selection via a modern optimization lens
• Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• Computing one-bit compressive sensing via double-sparsity constrained optimization
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Decoding by Linear Programming
• Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
• Global and quadratic convergence of Newton hard-thresholding pursuit
• Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
• Group Sparse Recovery via the \ell ^0(\ell ^2) Penalty: Theory and Algorithm
• scientific article; zbMATH DE number 6982301 (Why is no real title available?)
• scientific article; zbMATH DE number 6982922 (Why is no real title available?)
• Iterative thresholding for sparse approximations
• Minimization of \(SC^ 1\) functions and the Maratos effect
• Multivariate sparse group Lasso for the multivariate multiple linear regression with an arbitrary group structure
• Newton method for \(\ell_0\)-regularized optimization
• On constrained and regularized high-dimensional regression
• Probing the Pareto frontier for basis pursuit solutions
• Sparsity constrained nonlinear optimization: optimality conditions and algorithms
• Sparsity oracle inequalities for the Lasso
• The sparse principal component analysis problem: optimality conditions and algorithms

Cited in

(3)

• Newton-type methods with the proximal gradient step for sparse estimation
• Smoothing proximal gradient block-coordinate algorithms for group sparse _0 regularized nonsmooth convex regression problem
• Group sparsity-based fusion regularized clustering: new model and convergent algorithm

This page was built for publication: Subspace Newton method for sparse group \(\ell_0\) optimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6607024)