New theoretical results on recursive quadratic programming algorithms
From MaRDI portal
Publication:1265011
DOI10.1023/A:1022686919295zbMath0907.90220OpenAlexW122514726MaRDI QIDQ1265011
L. T. Santos, José Mario Martínez
Publication date: 11 February 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022686919295
Related Items
The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems, A regularization method for constrained nonlinear least squares, Outer trust-region method for constrained optimization, On the behaviour of constrained optimization methods when Lagrange multipliers do not exist
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
- Modifications to the subroutine OPALQP for dealing with large problems
- A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization
- Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization
- Algorithm 652
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- Convergence Theorems for Least-Change Secant Update Methods
- Local Convergence Theory of Inexact Newton Methods Based on Structured Least Change Updates
- Recursive quadratic programming methods based on the augmented lagrangian
- On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
- Path-Following Methods for Linear Programming
- Fixed-Point Quasi-Newton Methods
- Numerical Stability and Efficiency of Penalty Algorithms
- Why a Pure Primal Newton Barrier Step May be Infeasible
