Improved convergence order for augmented penalty algorithms
From MaRDI portal
Publication:2655402
DOI10.1007/s10589-007-9159-0zbMath1181.90244OpenAlexW2074149593MaRDI QIDQ2655402
Publication date: 25 January 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9159-0
Related Items (1)
The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
Uses Software
Cites Work
- Penalty functions, Newton's method, and quadratic programming
- Test examples for nonlinear programming codes
- Augmented non-quadratic penalty algorithms
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- Truncated-Newton algorithms for large-scale unconstrained optimization
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
- Augmented penalty algorithms
- Inexact Newton Methods
- Numerical Stability and Efficiency of Penalty Algorithms
- CUTEr and SifDec
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Improved convergence order for augmented penalty algorithms
