Convergence properties of inexact projected gradient methods

Optimization

Volumn 55, Issue 3, 2006, Pages 301-310

  Wang, Changyu ^a   Liu, Qian ^b  

^a QUFU NORMAL UNIVERSITY   (China)

^b INNER MONGOLIA UNIVERSITY   (China)

Author keywords

Convergence; Nonmonotone linear search; Projected gradient

Indexed keywords

EID: 33744998479     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331930600711448     Document Type: Article

References (18)

1. Barzilai, J. and Borwein, J.M., 1988, Two point step size gradient methods. IMA Journal of Numerical Analysis, 8, 141-148.
2. Birgin, E.G., Martínez, J.M. and Raydan, M., 2000, Nonmonotone spectral projected gradient methods on convex set. SIAM Journal on Optimization, 10, 1196-1211.
3. Birgin, E.G., Martínez, J.M. and Raydan, M., 2003, Inexact spectral projected gradient methods on convex set. IMA Journal of Numerical Analysis, 23, 539-559.
4. Bonnans, J.F., Panier, E.R., Tits, A.L. and Zhou, J.L., 1992, Avoiding the Maratos effect by means of a nonmonotone linear search II inequality constrained problems - feasible iterates. SIAM Journal on Numerical Analysis, 29, 1187-1202.
5. Calamai, P.H. and More, J.J., 1987, Projected gradient methods for linearly constrained problems. Mathematical Programming, 39, 93-116.
6. Dai, Y.H. and Liao, L.Z., 2002, R-linear convergence of the Barzilai and Borwein gradient method. IMA Journal of Numerical Analysis, 22, 1-10.
7. Dai, Y.H., 2002, On nonmontone line search. Journal of Optimization Theory and Applications, 112, 315-330.
8. Deng, N.Y., Xiao, Y. and Zhou, F.J., 1993, A nonmonotonic trust region algorithm. Journal of Optimization Theory and Applications, 76, 259-285.
9. Fletcher, R., 1990, Low storage methods for unconstrained optimization. Lectures in Applied Mathematics (AMS), 26, 165-179.
10. Goldstein, A.A., 1964, Convex programming in Hilbert space. Bulletin of American Mathematical Society. New Series, 70, 709-710.
11. Grippo, L., Lampariello, F. and Lucidi, S., 1986, A nonmonotone line search technique for Newton's method. SIAM Journal on Numerical Analysis, 23, 707-716.
12. Grippo, L., Lampariello, F. and Lucidi, S., 1989, A truncated method with nonmonotone line search for unconstrained optimization. Journal of Optimization. Theory and Applications, 60, 401-419.
13. Levitin, E.S. and Polyak, B.T., 1966, Constrained minimization methods. USSR Computational Mathematics and Mathematical Physics, 6, 1-50.
14. Panier, E.R. and Tits, A.L., 1991, Avoiding the Maratos effect by means of a nonmonotone linear search I. Constrained problems. SIAM Journal on Numerical Analysis, 28, 1183-1195.
15. Raydan, M., 1993, On the Barzilai and Borwein choice of steplength for the gradient method. IMA Journal of Numerical Analysis, 13, 321-326.
16. Solodov, M.V. and Svaiter, B.F., 1999, A hybrid projection-proximal point algorithm. Journal of Convex Analysis, 6, 59-71.
17. Solodov, M.V. and Svaiter, B.F., 1999, A new projection method for variational inequality problems. SIAM Journal on Control and Optimization, 37, 187-200.
18. Solodov, M.V. and Svaiter, B.F., 2000, A truly globally convergent Newton-type method for the monotone nonlinear complementary problem. SIAM Journal on Optimization, 10, 605-625.