An Ideal Penalty Function for Constrained Optimization

DOI10.1093/IMAMAT/15.3.319MaRDI QIDQ4090136zbMATH OpenOpenAlexFDO

Authors Roger Fletcher

Publication date 1975

Published in IMA Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/imamat/15.3.319

Mathematics Subject Classification ID

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

Cited in

(25)

• Stability in a class of discrete time models of interacting populations
• Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
• Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization
• A genetic algorithm based augmented Lagrangian method for constrained optimization
• Multiplier methods for engineering optimization
• Local convergence of the diagonalized method of multipliers
• Algorithms for nonlinear constraints that use lagrangian functions
• Multilevel least-change Newton-like methods for equality constrained optimization problems
• The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming
• An algorithm for composite nonsmooth optimization problems
• Adams-type methods with increased ranges of stability
• A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization
• A method for shape and topology optimization of truss-like structure
• On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints
• Accelerated convergence for the Powell/Hestenes multiplier method
• Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
• Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization
• Stiffly stable fourth order Adams-type methods
• A globally convergent, implementable multiplier method with automatic penalty limitation
• Analysis on a superlinearly convergent augmented Lagrangian method
• Energy-optimal controls in the mammalian neuromuscular system
• A note on the method of multipliers
• Stability in Gilpin and Ayala's models of competition
• Continuous-time gradient-like descent algorithm for constrained convex unknown functions: penalty method application
• Eigenvalue bounds for saddle-point systems with singular leading blocks

This page was built for publication: An Ideal Penalty Function for Constrained Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4090136)