Use of the augmented penalty function in mathematical programming problems. II. Conjugate gradient-restoration algorithm

DOI10.1007/BF00928473zbMath0208.45803MaRDI QIDQ2543396

E. E. Cragg, A. V. Levy, Angelo Miele

Publication date: 1971

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

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (7)

Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ COSMO: a conic operator splitting method for convex conic problems ⋮ A numerical study of multiplier methods for constrained parameter optimization ⋮ Multiplier methods: A survey ⋮ CONGAU - constrained minimization of least squares objective functions ⋮ An exact penalty function algorithm for solving general constrained parameter optimization problems ⋮ A numerical study of multiplier methods for constrained parameter optimization

Cites Work

• Sequential gradient-restoration algorithm for the minimization of constrained functions. Ordinary and conjugate gradient versions
• Modifications and extensions of the conjugate gradient-restoration algorithm for mathematical programming problems
• Use of the augmented penalty function in mathematical programming problems. I: Ordinary gradient algorithm
• A new method for the optimization of a nonlinear function subject to nonlinear constraints

This page was built for publication: Use of the augmented penalty function in mathematical programming problems. II. Conjugate gradient-restoration algorithm