New error bounds and their applications to convergence analysis of iterative algorithms

Mathematical Programming, Series B

Volumn 88, Issue 2, 2000, Pages 341-355

  Luo, Zhi Quan ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141603517     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050020     Document Type: Article

References (42)

1. Auslender, A. (1976): Optimisation: Méthodes Numériques. Massen, Paris
2. Bertsekas, D.P. (1976): On the Goldstein-Levitin-Polyak gradient projection method. IEEE Trans. Auto. Contr. 21, 174-184
3. Bertsekas, D.P., Gafni, E. (1982): Projection methods for variational inequalities with application to the traffic assignment problem. Math. Program. Study 12, 139-159
4. Bertsekas, D.P., Tseng, P. (1994): Partial proximal minimization algorithms for convex programming. SIAM J. Optim. 4, 551-572
5. Bertsekas, D.P., Tsitsiklis, J.N. (1989): Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ
6. Bierstone, E., Milman, P.D. (1988): Semianalytic and subanalytic sets. Institut des Hautes Etudes Scientifiques, Publications Mathématiques 67, 5-42
7. D'Esopo, D. (1959): A convex programming procedure. Naval Logist. Quart. 6, 33-42
8. Dedieu, J.P. (1992): Penalty functions in subanalytic optimization. Optimization 26, 27-32
9. Dunn, J.C. (1981): Global and asymptotic convergence rate estimates for a class of projected gradient processes. SIAM J. Control Optim. 19, 368-400
10. Gafni, E.M., Bertsekas, D.P. (1984): Two-metric projection methods for constrained optimization. SIAM J. Control Optim. 22, 936-964
11. Goldstein, A.A. (1964): Convex programming in Hilbert space. Bull. Am. Math. Soc. 70, 709-710
12. Güler, O. (1991): On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29, 403-419
13. Hildreth, C. (1957): A quadratic programming procedure. Naval Res. Logist. Quart. 4, 79-85 see also Erratum, Naval Res. Logist. Quart. 4, 361
14. Iusem, A.N. (1991): On dual convergence and the rate of primal convergence of Bregman's convex programming method. SIAM J. Optim. 1, 401-423
15. Iusem, A.N., Teboulle, M. (1995): Convergence rate analysis of nonquadratic proximal methods for convex and linear programming. Math. Oper. Res. 20, 657-677
16. Korpelevich, G.M. (1976): The extragradient method for finding saddle points and other problems. Matecon 12, 747-756
17. Kort, B.W., Bertsekas, D.P. (1976): Combined primal-dual and penalty methods for convex programming. SIAM J. Control Optim. 14, 268-294
18. Levitin, E.S., Polyak, B.T. (1966): Convergence of minimizing sequences in conditional extremum problems. Soviet Math. Doklady 7, 764-767
19. Li, W. (1993): Remarks on convergence of the matrix splitting algorithm for the symmetric linear complementarity problem. SIAM J. Optim. 3, 155-164
20. Li, W. (1995): Error bounds for piecewise convex quadratic programs and applications. SIAM J. Control Optim. 33, 1510-1529
21. Lojasiewicz, M.S. (1959): Sur le problème de la division. Studia Math. 18, 87-136
22. Luenberger, D.G. (1984): Linear and Nonlinear Programming. Addison-Wesley, Reading, MA
23. Luo, X.D., Luo, Z.-Q. (1994): Extensions of Hoffman's error bound to polynomial systems. SIAM J. Optim. 4, 383-392
24. Luo, Z.-Q., Pang, J.S. (1994): Error bounds for analytic systems and their applications. Math. Program. 67, 1-28
25. Luo, Z.-Q., Tseng, P. (1992): On the linear convergence of descent methods for convex essentially smooth minimization. SIAM J. Control Optim. 30, 408-425
26. Luo, Z.-Q., Tseng, P. (1992): On the convergence of coordinate descent method for convex differentiable minimization. J. Optim. Theory Appl. 72, 7-35
27. Luo, Z.-Q., Tseng, P. (1992): Error bound and the convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J. Optim. 2, 43-54
28. Luo, Z.-Q., Tseng, P. (1993): Error bounds and the convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46, 157-178
29. Luo, Z.-Q., Tseng, P. (1993): Error bound and reduced gradient projection algorithms for convex minimization over a polyhedral set. SIAM J. Optim. 3, 43-59
30. Luo, Z.-Q., Tseng, P. (1993): On the convergence rate of dual ascent methods for linearly constrained convex minimization. Math. Oper. Res. 18, 846-867
31. Luo, Z.-Q., Tseng, P. (1994): On the rate of convergence of a distributed asynchronous routing algorithm. IEEE Trans. Auto. Control 39, 1123-1129
32. Luque, F.J. (1984): Asymptotic convergence analysis of the proximal point algorithm. SIAM J. Control Optim. 22, 277-293
33. Mangasarian, O.L. (1977): Solution of symmetric linear complementarity problems by iterative methods. J. Optim. Theory Appl. 22, 465-485
34. Martinet, B. (1970): Regularization d'inéquations variationelles par approximations successives. Rev. Française d'Auto. Inform. Rech. Opér. 4, 154-159
35. Ortega, J.M., Rheinboldt, W.C. (1970): Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York
36. Pang, J.S. (1982): On the convergence of a basic iterative method for the implicit complementarity problem. J. Optim. Theory Appl. 37, 149-162
37. Pang, J.S. (1987): A posteriori error bound for the linearly-constrained variational inequality problem. Math. Oper. Res. 12, 474-484
38. Pang, J.S. (1997): Error bounds in mathemtical programming. Math. Program. 79, 299-332
39. Tseng, P. (1991): On the rate of convergence of a partially asynchronous gradient projection algorithm. SIAM J. Optim. 1, 603-319
40. Tseng, P. (1995): On linear convergence of iterative methods for the variational inequality problem. J. Comput. Appl. Math. 60, 237-252
41. Walkup, D.W., Wets, R.J.B. (1969): A Lipschitzian characterization of convex polyhedra. Proceedings of the American Mathematical Society 20, 167-173
42. Warga, J. (1963): Minimizing certain convex functions. J. Soc. Indust. Appl. Math. 11, 588-593