Skip to main content
SpringerLink
Log in

Sequential Quadratic Programming (SQP)

  • Chapter
  • First Online:
Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 121))

Abstract

SQP is an active-set method. In this chapter we consider both the equality-constrained and the inequality-constrained sequential quadratic programming.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  • Andrei, N. (2009). Critica RaÅ£iunii Algoritmilor de Optimizare fără RestricÅ£ii. [Criticism of the Unconstrained Optimization Algorithms Reasoning]. Editura Academiei Române, BucureÅŸti.

    Google Scholar 

  • Boggs, P. T., & Tolle, J. W. (1989). A strategy for global convergence in a sequential quadratic programming algorithm. SIAM Journal on Numerical Analysis, 21, 600–623.

    Article  MathSciNet  MATH  Google Scholar 

  • Boggs, P. T., & Tolle, J. W. (1995). Sequential quadratic programming. Acta Numerica, 4, 1–51.

    Article  MathSciNet  MATH  Google Scholar 

  • Byrd, R. H., Schnabel, R. B., & Shultz, G. A. (1987). A trust region algorithm for nonlinearly constrained optimization. SIAM Journal on Numerical Analysis, 24, 1152–1170.

    Article  MathSciNet  MATH  Google Scholar 

  • Byrd, R. H., Tapia, R. A., & Zhang, Y., (1990) An SQP augmented Lagrangian BFGS algorithm for constrained optimization. (Technical Report, University of Colorado at Boulder).

    Google Scholar 

  • Byrd, R. H., Gould, N. I. M., Nocedal, J., & Waltz, R. A. (2004a). An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Mathematical Programming, Series B, 100, 27–48.

    MathSciNet  MATH  Google Scholar 

  • Coleman, T. F., & Conn, A. R. (1982a). Nonlinear programming via an exact penalty function: Asymptotic analysis. Mathematical Programming, 24, 123–136.

    Article  MathSciNet  MATH  Google Scholar 

  • Coleman, T. F., & Conn, A. R. (1982b). Nonlinear programming via an exact penalty function: Global analysis. Mathematical Programming, 24, 137–161.

    Article  MathSciNet  MATH  Google Scholar 

  • Fletcher, R. (1982). Second order corrections for nondifferentiable optimization. In: D. Griffith, (Ed.) Numerical analysis, Berlin, Europe: Springer, 85–114. Proceedings Dundee 1981.

    Chapter  Google Scholar 

  • Fletcher, R., & Leyffer, S. (2002). Nonlinear programming without a penalty function. Mathematical Programming, Series A, 91, 239–269.

    Article  MathSciNet  MATH  Google Scholar 

  • Fletcher, R., & Sainz de la Maza, E. (1989). Nonlinear programming and nonsmooth optimization by successive linear programming. Mathematical Programming, 43, 235–256.

    Article  MathSciNet  MATH  Google Scholar 

  • Fletcher, R., Leyffer, S., & Toint, Ph. (1999). On the global convergence of an SLP-filter algorithm. (Numerical Analysis Report NA/183, August 1998. (Revised October 1999)).

    Google Scholar 

  • Fukushima, M. (1986). A successive quadratic programming algorithm with global and superlinear convergence properties. Mathematical Programming, 35, 253–264.

    Article  MathSciNet  MATH  Google Scholar 

  • Gabay, D. (1982). Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization. Mathematical Programming Study, 16, 18–44.

    Article  MathSciNet  MATH  Google Scholar 

  • Gould, N. I. M., Orban, D., & Toint, P. L. (2005a). Numerical methods for large-scale nonlinear optimization. Acta Numerica, 14, 299–361.

    Article  MathSciNet  MATH  Google Scholar 

  • Han, S. P. (1976). Superlinearly convergent variable metric algorithms for general nonlinear programming problems. Mathematical Programming, 11, 263–282.

    Article  MathSciNet  MATH  Google Scholar 

  • Han, S. P. (1977). A globally convergent method for nonlinear programming. Journal of Optimization Theory and Applications, 22, 297–309.

    Article  MathSciNet  MATH  Google Scholar 

  • Lalee, M., Nocedal, J., & Plantenga, T. (1998). On the implementation of an algorithm for large-scale equality constrained optimization. SIAM Journal on Optimization, 8, 682–706.

    Article  MathSciNet  MATH  Google Scholar 

  • Maratos, N. (1978). Exact penalty function algorithms for finite-dimensional and control optimization problems. Ph. D. Thesis, University of London.

    Google Scholar 

  • Mayne, D. Q., & Polak, E. (1982). A superlinearly convergent algorithm for constrained optimization problems. Mathematical Programming Studies, 16, 45–61.

    Article  MathSciNet  MATH  Google Scholar 

  • Nocedal, J., & Wright, S. J. (2006). Numerical optimization, Springer series in operations research (2nd ed.). New York, NY, USA: Springer Science+Business Media.

    MATH  Google Scholar 

  • Omojokun, E. (1989). Trust region algorithms for optimization with nonlinear equality and inequality constraints. Ph.D. Disertation, Department of Computer Science, University of Colorado.

    Google Scholar 

  • Powell, M. J. D. (1977). A fast algorithm for nonlinearly constrained optimization calculations. (Technical Report 77/NA2, Department of Applied Mathematics and Theoretical Physics, University of Cambridge).

    Google Scholar 

  • Powell, M. J. D. (1978a). A fast algorithm for nonlinearly constrained optimization calculations. In G. A. Watson (Ed.), Numerical analysis., Dundee 1977, Lecture notes in mathematics (vol. 630, pp. 144–157). Berlin, Europe: Springer.

    Chapter  Google Scholar 

  • Powell, M. J. D. (1978b). The convergence of variable metric methods of nonlinearly constrained optimization calculations. In O. L. Mangasarian, R. R. Meyer, & S. M. Robinson (Eds.), Nonlinear programming 3 (pp. 27–63). New York, NY, USA: Academic.

    Chapter  Google Scholar 

  • Powell, M. J. D. (1986). Convergence properties of algorithms for nonlinear optimization. SIAM Review, 28, 487–500.

    Article  MathSciNet  MATH  Google Scholar 

  • Robinson, S. M. (1974). Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear programming algorithms. Mathematical Programming, 7, 1–16.

    Article  MathSciNet  MATH  Google Scholar 

  • Schittkowski, K. (1981). The nonlinear programming method of Wilson, Han and Powell with an augmented Lagrangean type line search function, Part I: Convergence analysis. Numerische Mathematik, 38, 83–114.

    Article  MathSciNet  MATH  Google Scholar 

  • Schittkowski, K. (1983). On the convergence of a sequential quadratic programming method with an augmented Lagrange line search function. Mathematical Operations forschung und Statistik (Series Optimization), 14(2), 197–216.

    Article  MathSciNet  MATH  Google Scholar 

  • Wilson, R. B. (1963). A simplicial algorithm for concave programming. Ph.D Thesis, Harvard University.

    Google Scholar 

  • Wright, M. H. (1976). Numerical methods for nonlinearly constrained optimization. (SLAC Report No.193, 1976, Stanford University, California, 1976. (Ph.D. Dissertation)).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Informatics, Center for Advanced Modeling & Optimization, Bucharest, Romania

    Neculai Andrei

  2. Academy of Romanian Scientists, Bucharest, Romania

    Neculai Andrei

Authors
  1. Neculai Andrei
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Andrei, N. (2017). Sequential Quadratic Programming (SQP). In: Continuous Nonlinear Optimization for Engineering Applications in GAMS Technology. Springer Optimization and Its Applications, vol 121. Springer, Cham. https://doi.org/10.1007/978-3-319-58356-3_11

Download citation

Publish with us

Policies and ethics

Search

Navigation