scholarly journals On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces

2016 ◽  
Vol 37 (2) ◽  
pp. 129-144 ◽  
Author(s):  
J. Y. Bello Cruz ◽  
W. De Oliveira
2012 ◽  
Vol 2012 ◽  
pp. 1-10
Author(s):  
Shunhou Fan ◽  
Yonghong Yao

The projected-gradient method is a powerful tool for solving constrained convex optimization problems and has extensively been studied. In the present paper, a projected-gradient method is presented for solving the minimization problem, and the strong convergence analysis of the suggested gradient projection method is given.


2019 ◽  
Vol 36 (02) ◽  
pp. 1940008
Author(s):  
Jun Fan ◽  
Liqun Wang ◽  
Ailing Yan

In this paper, we employ the sparsity-constrained least squares method to reconstruct sparse signals from the noisy measurements in high-dimensional case, and derive the existence of the optimal solution under certain conditions. We propose an inexact sparse-projected gradient method for numerical computation and discuss its convergence. Moreover, we present numerical results to demonstrate the efficiency of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document