Skip to main content
Log in

Superlinear Convergence of a Stabilized SQP Method to a Degenerate Solution

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We describe a slight modification of the well-known sequential quadratic programming method for nonlinear programming that attains superlinear convergence to a primal-dual solution even when the Jacobian of the active constraints is rank deficient at the solution. We show that rapid convergence occurs even in the presence of the roundoff errors that are introduced when the algorithm is implemented in floating-point arithmetic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. D.P. Bertsekas, Nonlinear Programming, Athena Scientific: Belmont, MA, 1995.

    Google Scholar 

  2. A.L. Dontchev and W.W. Hager, “Lipschitzian stability for state constrained nonlinear optimal control,” SIAM J. Control Optim., vol. 36, pp. 696-718, 1998.

    Google Scholar 

  3. F. Facchinei, A. Fischer, and C. Kanzow, “On the accurate identification of active constraints,” DIS Technical Report 22.96, Universita' di Roma “La Sapienza”, 1996.

  4. A. Fischer, “Modified Wilson method for nonlinear programs with nonunique multipliers,” Technical Report MATH-NM-04-1997, Technische Universität Dresden, Institute of Numerical Mathematics, Technische Universität Dresden, D-01062, Dresden, Germany, Feb. 1997.

    Google Scholar 

  5. R. Fourer and S. Mehrotra, “Solving symmetric indefinite systems in an interior-point method for linear programming,” Mathematical Programming, vol. 62, pp. 15-39, 1993.

    Google Scholar 

  6. J. Gauvin, “A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming,” Mathematical Programming, vol. 12, pp. 136-138, 1977.

    Google Scholar 

  7. G.H. Golub and C.F. Van Loan, Matrix Computations, 2nd edition, The Johns Hopkins University Press: Baltimore, 1989.

    Google Scholar 

  8. W.W. Hager, “Convergence of Wright's stabilized SQP algorithm,” Technical Report, Department of Mathematics, University of Florida, Gainesville, Fl., Jan. 1997.

    Google Scholar 

  9. O.L. Mangasarian and S. Fromovitz, “The Fritz-John necessary optimality conditions in the presence of equality and inequality constraints,” Journal of Mathematical Analysis and Applications, vol. 17, pp. 37-47, 1967.

    Google Scholar 

  10. D. Ralph and S.J. Wright, “Superlinear convergence of an interior-point method despite dependent constraints,” Preprint ANL.MCS-P622-1196, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Ill., Nov. 1996.

    Google Scholar 

  11. D. Ralph and S.J. Wright, “Superlinear convergence of an interior-point method for monotone variational inequalities,” in Complementarity and Variational Problems: State of the Art, M.C. Ferris and J. Pang (Eds.), SIAM Publications, 1997, pp. 345-385.

  12. S.M. Robinson, “Local epi-continuity and local optimization,” Mathematical Programming, vol. 19, pp. 208-222, 1987.

    Google Scholar 

  13. S.J. Wright, “Stability of augmented system factorizations in interior-point methods,” Preprint MCS-P446-0694, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Ill., June 1994. To appear in SIAM Journal of Matrix Analysis and Applications.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wright, S.J. Superlinear Convergence of a Stabilized SQP Method to a Degenerate Solution. Computational Optimization and Applications 11, 253–275 (1998). https://doi.org/10.1023/A:1018665102534

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018665102534

Navigation