Abstract
The convergence of Rosen's gradient method is a long-standing problem in nonlinear programming. Recently, progress has been made by several researchers. In this paper, we completely resolve the problem.
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, NJ, 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.
D.-Z. Du and X.-S. Zhang, “A convergence theorem for Rosen's gradient projection method,”Mathematical Programming 36 (1986) 135–144.
D.-Z. Du, “Remark on the convergence of Rosen's gradient projection method,” MSRI04718–86.
D.-Z. Du, “A family of gradient projection algorithms,”Acta Mathematicae Applicatae Sinica (English Series) 2 (1985) 1–13.
D. Goldfarb, “Extension of Davidson's variable metric method to maximization under linear inequality 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.
X-Y. Gwei and D.-Z. Du, “A superlinearly convergent method to linearly constrained optimization problem under degeneracy,”Acta Mathematicae Applicatae Sinica (English Series) 1 (1984) 76–84.
G. He, “Proof of convergence of Rosen's gradient projection method,” Technical Report, Chengdu University of Science and Technology (1986) (in Chinese).
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, MA, 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) pp. 215–246.
E. Polak, “On the convergence of optimization algorithms,”Revue Francaise d'Informatique et de Recherche Opérationnelle 3 (1969) 17–34.
E. Polak,Computational Methods in Optimization (Academic Press, New York, 1971).
K. Ritter, “Convergence and superlinear convergence of algorithms for linearly constrained minimization problems,” in: L.C.W. Dixon, E. Spedicado, G.P. Szego, eds.,Nonlinear Optimization: Theory and Algorithm, Part II (Birkhauser, Boston, MA, 1980).
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.
M. Yue and J. Han, “A unified approach to the feasible direction methods for nonlinear programming with linear constraints,”Acta Mathematicae Applicatae Sinica (English Series) 1 (1984) 63–75.
W.I. Zhangwill, “Convergence conditions for nonlinear programming algorithms,”Management Science 16 (1961) 1–13.
W.I. Zangwill,Nonlinear Programming: A unified Approach (Prentice-Hall, Englewood Cliffs, NJ, 1969).
X.-S. Zhang, “An improved Rosen-Polak method,”Acta Mathematicae Applicatae Sinica 2 (1979) 257–267 (in Chinese).
X.-S. Zhang, “Discussion on Polak's algorithm for nonlinear programming,”Acta Mathematicae Applicatae Sinica 4 (1981) 1–13 (in Chinese).
X.-S. Zhang, “On the convergence of Rosen's gradient projection method: Three-dimensional case,”Acta Mathematicae Applicatae Sinica 8 (1985) (in Chinese).
Author information
Authors and Affiliations
Additional information
This author's work was supported in part by AF OSR-86-0078, NSF DMS-86-06225, and NSF of China.
Rights and permissions
About this article
Cite this article
Du, DZ., Zhang, XS. Global convergence of Rosen's gradient projection method. Mathematical Programming 44, 357–366 (1989). https://doi.org/10.1007/BF01587098
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01587098