SIAM Journal on Control and Optimization · 1976 · 30 citations · 13 references
Natural SciencesComputer ScienceMathematicsAlgorithmsComputational MechanicsOptimizationApproximation AlgorithmsConstrained OptimizationGradient-based OptimizationNumerical AlgorithmsOptimization TheoryUnconstrained OptimizationConvergenceGradient DescentImplicit Function TheoremLagrange MultipliersLagrangian FunctionLagrangian OptimizationMinimizationSteepest Descent
This paper presents three computational methods which extend to nonlinearly constrained minimization problems the efficient convergence properties of, respectively, the method of steepest descent, the variable metric method, and Newton’s method for unconstrained minimization. Development of the algorithms is based on use of the implicit function theorem to essentially convert the original constrained problem to an unconstrained one. This approach leads to practical and efficient algorithms in the framework of Abadie’s generalized reduced gradient method. To achieve efficiency, it is shown that it is necessary to construct a sequence of approximations to the Lagrange multipliers of the problem simultaneously with the approximations to the solution itself. In particular, the step size of each iteration must be determined by a linesearch for a minimum of an approximate Lagrangian function.
13
Function minimization by conjugate gradients
R. Fletcher · The Computer Journal · 1964 · 4.9K citations · Full text
A Rapidly Convergent Descent Method for Minimization
R. Fletcher, M. J. D. Powell · The Computer Journal · 1963 · 4.6K citations · Full text
Introduction to linear and nonlinear programming
E. Polak · IEEE Transactions on Automatic Control · 1974 · 2.1K citations