An Ideal Penalty Function for Constrained Optimization
From MaRDI portal
Cited in
(29)- An algorithm for composite nonsmooth optimization problems
- Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization
- A globally convergent, implementable multiplier method with automatic penalty limitation
- Stiffly stable fourth order Adams-type methods
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Local convergence of the diagonalized method of multipliers
- Stability in Gilpin and Ayala's models of competition
- Stability in a class of discrete time models of interacting populations
- Adams-type methods with increased ranges of stability
- Energy-optimal controls in the mammalian neuromuscular system
- A genetic algorithm based augmented Lagrangian method for constrained optimization
- Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
- Continuous-time gradient-like descent algorithm for constrained convex unknown functions: penalty method application
- A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization
- Analysis on a superlinearly convergent augmented Lagrangian method
- Multilevel least-change Newton-like methods for equality constrained optimization problems
- A method for shape and topology optimization of truss-like structure
- Accelerated convergence for the Powell/Hestenes multiplier method
- Multiplier methods for engineering optimization
- The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming
- Algorithms for nonlinear constraints that use lagrangian functions
- Eigenvalue bounds for saddle-point systems with singular leading blocks
- Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization
- Cardinality objective nonlinear programs for facility capacity expansion
- Anti-windup higher derivative Newton-based extremum seeking under input saturation
- Optimisation by predefined upper bound of settling time convergent projected gradient flows
- The augmented Lagrangian methods: overview and recent advances
- A note on the method of multipliers
- On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints
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)
