New Theoretical Results on Recursive Quadratic Programming Algorithms
Authors:
- 1 May 1998
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 97 (2) , 435-454
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimizationJournal of Optimization Theory and Applications, 1995
- Numerical Stability and Efficiency of Penalty AlgorithmsSIAM Journal on Numerical Analysis, 1995
- A note on using alternative second-order models for the subproblems arising in barrier function methods for minimizationNumerische Mathematik, 1994
- Modifications to the subroutine OPALQP for dealing with large problemsJournal of Economic Dynamics and Control, 1994
- Path-Following Methods for Linear ProgrammingSIAM Review, 1992
- On the Convergence of a Sequential Penalty Function Method for Constrained MinimizationSIAM Journal on Numerical Analysis, 1989
- Algorithm 652ACM Transactions on Mathematical Software, 1987
- Recursive quadratic programming methods based on the augmented lagrangian1987
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty FunctionsIMA Journal of Numerical Analysis, 1986
- Convergence Theorems for Least-Change Secant Update MethodsSIAM Journal on Numerical Analysis, 1981