Skip to main content

Advertisement

Log in

A new inexact SQP algorithm for nonlinear systems of mixed equalities and inequalities

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

Traditional inexact SQP algorithm can only solve equality constrained optimization (Byrd et al. Math. Program. 122, 273–299 2010). In this paper, we propose a new inexact SQP algorithm with affine scaling technique for nonlinear systems of mixed equalities and inequalities, which arise in complementarity and variational inequalities. The nonlinear systems are transformed into a special nonlinear optimization with equality and bound constraints, and then we give a new inexact SQP algorithm for solving it. The new algorithm equipped with affine scaling technique does not require a quadratic programming subproblem with inequality constraints. The search direction is computed by solving one linear system approximately using iterative linear algebra techniques. Under mild assumptions, we discuss the global convergence. The preliminary numerical results show the effectiveness of the proposed algorithm.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Byrd, R.H., Curtis, F.E., Nocedal, J.: An inexact SQP method for equality constrained optimization. SIAM J. Optim. 19, 351–369 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Byrd, R.H., Curtis, F.E., Nocedal, J.: An inexact Newton method for nonconvex equality constrained optimization. Math. Program. 122, 273–299 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Curtis, F.E., Nocedal, J., Wacher, A.: A matrix-free algorithm for equality constrained optimization problems with rank-deficient Jacobians. SIAM J. Optim. 20, 1224–1249 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, Y., Sun, W.: A dwindling filter line search method for unconstrained optimization. Math. Comput. 84, 187–208 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  5. Coleman, T.F., Li, Y.: An interior trust region approach for nonlinear minimization subject to bounds. SIAM J. Optim. 6, 418–445 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dennis, J.E., El-Alem, M., Williamson, K.: A trust-region approach to nonlinear systems of equalities and inequalities. SIAM J. Optim. 9, 291–315 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gu, C., Zhu, D.: An inexact secant algorithm for large scale nonlinear systems of equalities and inequalities. Appl. Math. Modell. 36, 3612–3620 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gu, C.: A dwindling filter inexact projected Hessian algorithm for large scale nonlinear constrained optimization. Appl. Math. Comput. 219, 10898–10908 (2013)

    MathSciNet  MATH  Google Scholar 

  9. Heinkenschloss, M., Ulbrich, M., Ulbrich, S.: Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict comlpementarity assumption. Math. Program. 86, 615–635 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kanzow, C., Klug, A.: On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints. Comput. Optim. Appl. 35, 177–197 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Li, C.J., Sun, W.Y.: On filter-successive linearization methods for nonlinear semidefinite programming. Sci. China Ser. A 52, 2341–2361 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  12. Macconi, M., Morini, B., Porcelli, M.: Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities. Appl. Numer. Math. 59, 859–876 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  13. Morini, B., Porcelli, M.: TRESNEI, a Matlab trust-region solver for systems of nonlinear equalities and inequalities. Comput. Optim. Appl. 51, 27–49 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  14. Porcelli, M.: On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds. Optim. Lett. 7, 447–465 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  15. Nocedal, J., Wright, S.: Numerical Optimization. Springer-Verlag, New York (1999)

    Book  MATH  Google Scholar 

  16. Nie, P.Y.: Sequential penalty quadratic programming filter methods for nonlinear programming. Nonlin. Anal. Real World Appl. 8, 118–129 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  17. Sun, W., Yuan, Y.: Optimization Theory and Methods: Nonlinear Programming. Springer, Berlin (1999)

    Google Scholar 

  18. Su, K.: A globally and superlinearly convergent modified SQP-filter method. J. Global Optim. 41, 203–217 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  19. Shen, C.G., Xue, W.J., Pu, D.G.: Global convergence of a tri-dimensional filter SQP algorithm based on the line search method. Appl. Numer. Math. 59, 235–250 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  20. Wang, X.L., Zhu, Z.B., Zuo, S.Y., Huang, Q.Q.: An SQP-filter method for inequality constrained optimization and its global convergence. Appl. Math. Comput. 217, 10224–10230 (2011)

    MathSciNet  MATH  Google Scholar 

  21. Wächter, A., Biegler, L.T.: Global and local convergence of line search filter methods for nonlinear programming. CAPD Technical Report B-01-09, Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania 2001 (Revised 2002)

  22. Wächter, A., Biegler, L.T.: Line search filter methods for nonlinear programming: Motivation and global convergence. SIAM J. Optim. 16, 1–31 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  23. Wächter, A., Biegler, L.T.: Line search filter methods for nonlinear programming: Local convergence. SIAM J. Optim. 6, 32–48 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  24. Yang, L., Chen, Y., Tong, X.: Smoothing newton-like method for the solution of nonlinear systems of equalities and inequalities. Numer. Math. Theor. Meth. Appl. 2, 224–236 (2009)

    MathSciNet  MATH  Google Scholar 

  25. Zhu, X.J., Pu, D.G.: A line search filter algorithm with inexact step computations for equality constrained optimization. Appl. Numer. Math. 62, 212–223 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  26. Zhang, Y., Huang, Z.: A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities. J. Comput. Appl. Math. 233, 2312–2321 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The authors gratefully acknowledge the Projects (No. 11201304, No. 11371253) supported by the National Natural Science Foundation of China, the Project supported by the Innovation Program of Shanghai Municipal Education Commission, the project sponsored by Natural Science Foundation of Shanghai.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chao Gu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gu, C., Zhu, D. & Pei, Y. A new inexact SQP algorithm for nonlinear systems of mixed equalities and inequalities. Numer Algor 78, 1233–1253 (2018). https://doi.org/10.1007/s11075-017-0421-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-017-0421-y

Keywords

Mathematics Subject Classification (2010)

Navigation