Strong uniqueness in sequential linear programming
Authors:
- 1 January 1990
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
- Vol. 31 (4) , 379-384
Abstract
It is known that strong uniqueness can be used to prove second order convergence of the generalised Gauss-Newton algorithm. Formally this algorithm includes sequential linear programming as a special case. Here we show that the second order convergence result extends when the sequential linear programming algorithm is formulated appropriately. Also this discussion provides an example which shows that the assumption of Lipschitz continuity is necessary for the second order convergence result based on strong uniqueness.Keywords
This publication has 5 references indexed in Scilit:
- Convergence of SQP-Like Methods for Constrained OptimizationSIAM Journal on Control and Optimization, 1989
- An Improved Successive Linear Programming AlgorithmManagement Science, 1985
- Local properties of algorithms for minimizing nonsmooth composite functionsMathematical Programming, 1985
- Strong uniqueness and second order convergence in nonlinear discrete approximationNumerische Mathematik, 1980
- Strong uniquenessNumerische Mathematik, 1978