Newton Greedy Pursuit: A Quadratic Approximation Method for Sparsity-Constrained Optimization

Author(s):  
Xiao-Tong Yuan ◽  
Qingshan Liu
IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 28404-28416 ◽  
Author(s):  
Wenxing Zhu ◽  
Zhengshan Dong ◽  
Yuanlong Yu ◽  
Jianli Chen

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Ye Li ◽  
Jun Sun ◽  
Biao Qu

Nonnegative sparsity-constrained optimization problem arises in many fields, such as the linear compressing sensing problem and the regularized logistic regression cost function. In this paper, we introduce a new stepsize rule and establish a gradient projection algorithm. We also obtain some convergence results under milder conditions.


Sign in / Sign up

Export Citation Format

Share Document