Skip to main content
SpringerLink
Log in

An Extended Sequential Quadratically Constrained Quadratic Programming Algorithm for Nonlinear, Semidefinite, and Second-Order Cone Programming

  • Invited Paper
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

This paper is concerned with nonlinear, semidefinite, and second-order cone programs. A general algorithm, which includes sequential quadratic programming and sequential quadratically constrained quadratic programming methods, is presented for solving these problems. In the particular case of standard nonlinear programs, the algorithm can be interpreted as a prox-regularization of the Solodov sequential quadratically constrained quadratic programming method presented in Mathematics of Operations Research (2004). For such type of methods, the main cost of computation amounts to solve a linear cone program for which efficient solvers are available. Usually, “global convergence results” for these methods require, as for the Solodov method, the boundedness of the primal sequence generated by the algorithm. The other purpose of this paper is to establish global convergence results without boundedness assumptions on any of the iterative sequences built by the algorithm.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Solodov, M.V.: On the sequential quadratically constrained quadratic programming method. Math. Oper. Res. 29, 64–79 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Wilson, R.B.: A simplicial method for convex programming. Ph.D. Thesis, Harvard University (1963)

  3. Gill, P.E., Wong, E.: Sequential quadratic programming methods. Technical Report NA-10-03, UCSD Department of Mathematics (2010)

  4. Ben-Tal, A., Nemirovski, A.: In: Lectures on Modern Convex Optimization, Analysis, Algorithms and Engineering Applications. MPS-SIAM Series on Optimization (2001)

    Chapter  Google Scholar 

  5. Tutuncu, R.H., TOH, K.C., Todd, M.J.: Solving semidefinite quadratic-linear programs using SDPT3. Math. Program., Ser. B 95, 189–217 (2003)

    Article  MathSciNet  Google Scholar 

  6. Lan, G., Lu, Z., Monteiro, R.D.C.: Primal-dual first-order methods with \(O(\frac{1}{\epsilon })\) iteration-complexity for cone programming. Math. Program. 126, 1–29 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Solodov, M.V.: Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences. Math. Program., Ser. A 118, 1–12 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fukushima, M., Luo, Z.-Q., Tseng, P.: A sequential quadratically constrained quadratic programming method for differentiable convex minimization. SIAM J. Optim. 13, 1098–1119 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Auslender, A.: A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results. Math. Program. (2013). doi:10.1007/s10107-012-0582-3

    Google Scholar 

  10. Kanzow, C., Nagel, C., Kato, H., Fukushima, M.: An SQP-Type algorithm for nonlinear semidefinite programming. SIAM J. Optim. 31, 251–273 (2005)

    MathSciNet  MATH  Google Scholar 

  11. Correa, R., Ramirez, H.: A global algorithm for nonlinear semidefinite programming. SIAM J. Optim. 15, 303–318 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kato, H., Fukushima, M.: An SQP-Type algorithm for nonlinear second-order cone programs. Optim. Lett. 1, 129–144 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer Series in Operations Research (2000)

    MATH  Google Scholar 

  14. Bertsekas, D.: Nonlinear Programming. Athena Scientific, Belmont (1995)

    MATH  Google Scholar 

  15. Rockafellar, T., Roger-Wets, J.-B.: Variational Analysis. A Series of Comprehensive studies in Mathematics, vol. 317. Springer, Berlin (1998)

    Book  MATH  Google Scholar 

  16. Wiest, E.J., Polak, E.: A generalized quadratic programming-based phase-I–phase II method for inequality-constrained optimization. Appl. Math. Optim. 26, 223–252 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  17. Auslender, A., Shefi, R., Teboulle, M.: A moving balls approximation method for a class of smooth constrained minimization problems. SIAM J. Optim. 20, 3232–3259 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  18. Nesterov, Y.: On an approach to the construction of optimal methods of minimization of smooth convex functions. Èkon. Mat. Metody 24, 509–517 (1988)

    MathSciNet  MATH  Google Scholar 

  19. Fukushima, M.: A successive quadratic programming algorithm with global and superlinear convergence properties. Math. Program. 35, 253–264 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  20. Auslender, A., Teboulle, M.: Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer Monographs in Mathematics. Springer, New York (2003)

    MATH  Google Scholar 

  21. Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss–Seidel methods. Math. Program. (2011). doi:10.1007/s1017-011

    Google Scholar 

  22. Bolte, J., Danillis, A., Lewis, A.: Tame functions are smooth. Math. Program. 117, 5–19 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Camille Jordan, University Lyon I, Lyon, France

    Alfred Auslender

  2. Department of Economics, Ecole Polytechnique, Palaiseau, France

    Alfred Auslender

Authors
  1. Alfred Auslender
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alfred Auslender.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Auslender, A. An Extended Sequential Quadratically Constrained Quadratic Programming Algorithm for Nonlinear, Semidefinite, and Second-Order Cone Programming. J Optim Theory Appl 156, 183–212 (2013). https://doi.org/10.1007/s10957-012-0145-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-012-0145-z

Keywords

Search

Navigation