On the convergence of the block nonlinear Gauss-Seidel method under convex constraints

Operations Research Letters

Volumn 26, Issue 3, 2000, Pages 127-136

  Grippo, L ^a   Sciandrone, M ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; NONLINEAR PROGRAMMING;

DECOMPOSITION METHODS; GAUSS-SEIDEL METHODS;

OPERATIONS RESEARCH;

EID: 0033904057     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00074-7     Document Type: Article

References (15)

1. Auslender A. Asymptotic properties of the Fenchel dual functional and applications to decomposition problems. J. Optim. Theory Appl. 73(3):1992;427-449.
2. Bazaraa M.S., Sherali H.D., Shetty C.M. Nonlinear Programming. 1993;Wiley, New York.
3. Bertsekas D.P. Nonlinear Programming. 1995;Athena Scientific, Belmont, MA.
4. Bertsekas D.P., Tseng P. Partial proximal minimization algorithms for convex programming. SIAM J. Optim. 4(3):1994;551-572.
5. Bertsekas D.P., Tsitsiklis J.N. Parallel and Distributed Computation. 1989;Prentice-Hall, Englewood Cliffs, NJ.
6. Grippo L., Sciandrone M. Globally convergent block-coordinate techniques for unconstrained optimization. Optim. Methods Software. 10:1999;587-637.
7. Konno H. A cutting plane algorithm for solving bilinear programs. Math. Programming. 11:1976;14-27.
8. Konno H. Maximization of a convex quadratic function under linear constraints. Math. Programming. 11:1976;117-127.
9. Luo Z.Q., Tseng P. On the convergence of the coordinate descent method for convex differentiable minimization. J. Optim. Theory Appl. 72:1992;7-35.
10. Ortega J.M., Rheinboldt W.C. Iterative Solution of Nonlinear Equations in Several Variables. 1970;Academic Press, New York.
11. Patriksson M. Decomposition methods for differentiable optimization problems over Cartesian product sets. Comput. Optim. Appl. 9(1):1998;5-42.
12. Powell M.J.D. On search directions for minimization algorithms. Math. Programming. 4:1973;193-201.
13. Tseng P. Decomposition algorithm for convex differentiable minimization. J. Optim. Theory Appl. 70:1991;109-135.
14. Zadeh N. A note on the cyclic coordinate ascent method. Management Sci. 16:1970;642-644.
15. Zangwill W.I. Nonlinear Programming: A Unified Approach. 1969;Prentice-Hall, Englewood Cliffs, NJ.