Geometric approach to Fletcher's ideal penalty function

DOI10.1007/BF02192124zbMath0823.90111MaRDI QIDQ1893322

Bruce Christianson

Publication date: 3 July 1995

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

zbMATH Keywords

automatic differentiationvalidationreverse accumulationdifferentiable penalty functiontermination proofsequality constrained problemsgeometric formulation of an ideal penalty function

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Optimizing preventive maintenance models, Parameterization and estimation of path models for categorical data, On the generalization problem, Automatic differentiation of algorithms

Cites Work

• Unnamed Item
• Truncated Newton method for sparse unconstrained optimization using automatic differentiation
• Enlarging the region of convergence of Newton's method for constrained optimization
• An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems
• A recursive quadratic programming algorithm that uses differentiable exact penalty functions
• A New Class of Augmented Lagrangians in Nonlinear Programming
• Automatic Hessians by reverse accumulation
• On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic Programming
• An exact penalty function for nonlinear programming with inequalities