论文信息 - Multiplier and gradient methods

Multiplier and gradient methods

The main purpose of this paper is to suggest a method for finding the minimum of a functionf(x) subject to the constraintg(x)=0. The method consists of replacingf byF=f+λg+1/2cg2, wherec is a suitably large constant, and computing the appropriate value of the Lagrange multiplier. Only the simplest algorithm is presented. The remaining part of the paper is devoted to a survey of known methods for finding unconstrained minima, with special emphasis on the various gradient techniques that are available. This includes Newton's method and the method of conjugate gradients.

M. Hestenes

[1] M. Hestenes. An indirect sufficiency proof for the problem of Bolza in nonparametric form , 1947 .

[2] M. Hestenes. A GENERAL PROBLEM IN THE CALCULUS OF VARIATIONS WITH APPLICATIONS TO PATHS OF LEAST TIME , 1950 .

[3] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .

[4] M. Stein. On methods for obtaining solutions of fixed end-point problems in the calculus of variations , 1953 .

[5] Iterative computational methods , 1955 .

[6] Roger Fletcher,et al. A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[7] G. E. Myers. Properties of the conjugate-gradient and Davidon methods , 1968 .

[8] Lawrence B. Horwitz,et al. Davidon’s Method in Hilbert Space , 1968 .

[9] A. Balakrishnan. On a new computing technique in optimal control and its application to minimal-time flight profile optimization , 1969 .