Skip to main content
Log in

Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization

  • Published:
Acta Mathematica Sinica, English Series Aims and scope Submit manuscript

Abstract

Chen and Zhang [Sci. China, Ser. A, 45, 1390–1397 (2002)] introduced an affine scaling trust region algorithm for linearly constrained optimization and analyzed its global convergence. In this paper, we derive a new affine scaling trust region algorithm with dwindling filter for linearly constrained optimization. Different from Chen and Zhang’s work, the trial points generated by the new algorithm are accepted if they improve the objective function or improve the first order necessary optimality conditions. Under mild conditions, we discuss both the global and local convergence of the new algorithm. Preliminary numerical results are reported.

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. Bai, Y. Q., Wang, G. Q.: Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function. Acta Math. Sin., Engl. Ser., 23, 2027–2042 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bai, Y. Q., Guo, J. L., Roos, C.: A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms. Acta Math. Sin., Engl. Ser., 25, 2169–2178 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bonnans, J. F., Pola, C.: A trust region interior point algorithm for linear constrained optimization. SIAM J. Optim., 7, 717–731 (1997)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Chen, Z. W., Zhang, X. S.: A trust-region and affine scaling algorithm for linearly constrained optimization. Sci. China Ser. A, 45, 1390–1397 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chin, C. M., Rashid, A. H. A., Nor, K. M.: Global and local convergence of a filter line search method for nonlinear programming. Optim. Methods Softw., 22, 365–390 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Conn, A. R., Gould, N. I. M., Toint, Ph. L.: Trust Region Methods, MPS/SIAM Ser. Optim. 1, SIAM, Philadelphia, 2000

    Book  Google Scholar 

  8. Fletcher, R., Leyffer, S. Nonlinear programming without a penalty function. Math. Program, 91, 239–269 (2002)

    MathSciNet  Google Scholar 

  9. Fletcher, R., Leyffer, S., Toint, P. L.: On the global convergence of a filter-SQP algorithm. SIAM J. Optim., 13, 44–59 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fletcher, R., Gould, N. I. M., Leyffer, S., et al.: Global convergence of a trust-region SQP-filter algorithm for general nonlinear programming. SIAM J. Optim., 13, 635–659 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gu, C., Zhu, D.: A non-monotone line search multidimensional filter-SQP method for general nonlinear programming. Numer. Algor., 56, 537–559 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  12. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Nocedal, J., Wright, S.: Numerical Optimization, Springer-Verlag, New York, 1999

    Book  MATH  Google Scholar 

  15. Su, K., Pu, D. G.: A nonmonotone filter trust region method for nonlinear constrained optimization. J. Comput. Appl. Math., 223, 230–239 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Su, K., Liu, Y.: A modified filter trust region method for nonlinear programming. Acta Math. Sin., Chin. Ser., 52, 1157–1164 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. 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 

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

    MathSciNet  MATH  Google Scholar 

  19. Yuan, G. L., Wei, Z. X.: The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions. Acta Math. Sin., Engl. Ser., 24, 35–42 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  20. Zhu, D.: Nonmonotonic back-tracking trust region interior point algorithm for linear constrained minimization. J. Comput. Appl. Math., 155, 285–305 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  21. Zhu, D.: Superlinearly convergent affine scaling interior trust-region method for linear Constrained LC1 Minimization. Acta Math. Sin., Engl. Ser., 24, 2081–2100 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  22. Zhu, Z. B., Jian, J. B.: An improved feasible QP-free algorithm for inequality constrained optimization. Acta Math. Sin., Engl. Ser., 28, 2475–2488 (2012)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chao Gu.

Additional information

Supported by National Natural Science Foundation of China (Grant Nos. 11201304 and 11371253) and the Innovation Program of Shanghai Municipal Education Commission

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.T. Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization. Acta. Math. Sin.-English Ser. 32, 1203–1213 (2016). https://doi.org/10.1007/s10114-016-4513-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10114-016-4513-8

Keywords

MR(2010) Subject Classification

Navigation