Abstract
Since Rosen’s gradient projection method was published in 1960, a rigorous convergence proof of his method has remained an open question. A convergence theorem is given in this paper.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Avriel,Nonlinear Programming: Analysis and Methods (Prentice-Hall, Englewood Cliffs, N.J., 1976).
M.S. Bazaraa and C.M. Shetty,Nonlinear Programming: Theory and Algorithms (John Wiley & Sons, New York, 1979).
J. Denel, “Extensions of the continuity of point-to-set maps: applications to fixed point algorithms,”Mathematical Programming Study 10 (1979) 48–68.
D.-Z. Du, “A modification of Rosen-Polak’s algorithm,”Kexue Tonbao 28 (1983) 301–305.
C. Goffmand and C. Pedrick, First Course in Functional Analysis (Prentice-Hall, Englewood Cliffs, N.J., 1965).
D. Goldfarb, “Extension of Davidson’s variable metric method to maximization under linear equality and equality constraints,”SIAM Journal on Applied Mathematics 17 (1969) 739–764.
D. Goldfarb and L. Lapidus, “Conjugate gradient method for nonlinear programming problems with linear constraints,”Industrial and Engineering Chemistry Fundamentals 7 (1968) 142–151.
P. Huard, “Optimization algorithms and point-to-set maps,”Mathematical Programming 8 (1975) 308–331.
D.G. Luenberger, Introduction to Linear and Nonlinear Programming (Addison-Wesley, Reading, Mass., 1973).
R.R. Meyer, “The validity of a family of optimization methods,”SIAM Journal on Control and Optimization 8 (1970) 41–54.
R.R. Meyer “Sufficient conditions for the convergence of monotonic mathematical programming algorithms,”Journal of Computer and System Sciences 12 (1976) 108–121.
B.A. Murtagh and R.W.H. Sargent, “A constrained minimization method with quadratic convergence,” in R. Fletcher, ed.,Optimization (Academic Press, New York, 1969) 215–246.
E. Palak, “On the convergence of optimization algorithms,” Revue Francaise d’Informatique et de Recherche Operationelle 3 (1969) 17–34.
E. Polak,Computational Methods in Optimization (Academic Press, New York, 1971).
J.B. Rosen, “The gradient projection method for nonlinear programming, Part 1: linear constraints,”SIAM Journal on Applied Mathematics 8 (1960) 181–217.
J.B. Rosen, “The gradient projection method for nonlinear programming, Part 2: nonlinear constraints,”SIAM Journal on Applied Mathematics 9 (1961) 514–553.
W.I. Zangwill, “Convergence conditions for nonlinear programming algorithms,”Management Science 16 (1969) 1–13.
W.I. Zangwill,Nonlinear Programming: A Unified Approach (Prentice-Hall, Englewood Cliffs, N.J., 1969).
X.-S. Zhang, “An improved Rosen-Polak method,”Acta Mathematicae Applacatae Sinica 2 (1979) 257–267 (in Chinese).
X.-S. Zhang, “Discussion on Polak’s algorithm of nonlinear programming,”Acta Mathematicae Applacatae Sinica 4 (1981) 1–13 (in Chinese).
X.-S. Zhang, “On the convergence of Rosen’s gradient projection method: Three-dimensional case,”Acta Mathematicae Applacatae Sinica 8 (1985) (in Chinese).
Author information
Authors and Affiliations
Additional information
Part of this author’s work was done while he studied at the Department of Mathematics, University of California at Santa Barbara, and was supported by the National Science Foundation under Grant No. MCS83-14977.
Part of this author’s work was done while he visited the Computer Science Department, University of Minnesota, Minneapolis, and was supported by the National Science Foundation under Grant No. MCS81-01214.
Rights and permissions
About this article
Cite this article
Du, DZ., Zhang, XS. A convergence theorem of Rosen’s gradient projection method. Mathematical Programming 36, 135–144 (1986). https://doi.org/10.1007/BF02592021
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02592021