A greedy Newton-type method for multiple sparse constraint problem

DOI10.1007/s10957-022-02156-2OpenAlexW4316014651MaRDI QIDQ2696970

Yanyan Li

Publication date: 17 April 2023

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-022-02156-2

zbMATH Keywords

convergence analysisnumerical experimentstationary pointgradient projection Newton algorithmmultiple sparse

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Uses Software

• GQTPAR
• SPGL1

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• On solutions of sparsity constrained optimization
• Fast global convergence of gradient methods for high-dimensional statistical recovery
• Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications
• Gradient projection Newton pursuit for sparsity constrained optimization
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
• Computing a Trust Region Step
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Group Sparse Recovery via the $\ell ^0(\ell ^2)$ Penalty: Theory and Algorithm
• Greedy Sparsity-Constrained Optimization
• Model Selection and Estimation in Regression with Grouped Variables
• Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions
• Gaining Outlier Resistance With Progressive Quantiles: Fast Algorithms and Theoretical Studies

This page was built for publication: A greedy Newton-type method for multiple sparse constraint problem