On the convergence properties of the projected gradient method for convex optimization
By Alfredo Noel Iusem. 2003
127 citations recorded by the source corpus.
Subfields: Computational Mechanics, Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/365d04b4514d7a3b4befe64f4a95c2823312cb1f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
- Mário A. T. Figueiredo
- Stephen J. Wright
- Robert D. Nowak
- Mark W. Schmidt
- Yin Zhang
- Richard Baraniuk
- Stephen P. Boyd
- Paul-Emile Maingé
In Computational Theory and Mathematics
- Paul-Emile Maingé
- Stephen J. Wright
- Mário A. T. Figueiredo
- Robert D. Nowak
- Duong Viet Thong
- Dang Van Hieu
- Yekini Shehu
- Oluwatosin Temitope Mewomo
In Numerical Analysis
- Paul-Emile Maingé
- Stephen J. Wright
- Mário A. T. Figueiredo
- Robert D. Nowak
- Duong Viet Thong
- Dang Van Hieu
- Yekini Shehu
- Phan Tu Vuong
Citations in the corpus
- Strong Convergence of Projected Subgradient Methods for Nonsmooth and Nonstrictly Convex Minimization (2008, background): “Most of the related convergence results deal with Armijo-type rules for choosing the stepsizes [5, 13, 15 , 25].”
- Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems (2007, methodology): “Convergence of the methods proposed above can be derived from the analysis of Bertsekas [3] and Iusem [33], but follows most directly from the results of Birgin, Martinez, and Raydan [4] and Serafini, Zanghirati, and Zanni [51].”