An accelerated multiplier method for nonlinear programming

DOI10.1007/BF00932517zbMath0325.65027MaRDI QIDQ1225434

John T. Betts

Publication date: 1977

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Decomposition Methods Based on Augmented Lagrangians: A Survey, Multi-stage Monte Carlo and non-linear test problems, An extension of the simplex method to constrained nonlinear optimization, A class of generalized variable penalty methods for nonlinear programming, A suboptimal feedback control for nonlinear time-varying systems with continuous inequality constraints, Variable penalty methods for constrained minimization, A comparative performance evaluation of 27 nonlinear programming codes, Unnamed Item, A gradient projection-multiplier method for nonlinear programming, Nonlinear programming on a microcomputer, Test example for nonlinear programming codes, Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method, Numerical experience with conjugate direction methods in constrained minimization

Cites Work

• An improved penalty function method for solving constrained parameter optimization problems
• Use of the augmented penalty function in mathematical programming problems. I: Ordinary gradient algorithm
• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• A new method for the optimization of a nonlinear function subject to nonlinear constraints
• A General Quadratic Programming Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item