论文信息 - The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization - 字舞流文

The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization

In this paper, a new variation of the quasi-Newton-SQP methods for constrained optimization is proposed. Under some suitable assumptions, the superlinear convergence of the new method has been established.

Liying Liu | Zengxin Wei | Shengwei Yao | Zengxin Wei | Shengwei Yao | Liying Liu

[1] T. Coleman,et al. On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem , 1984 .

[2] Masao Fukushima,et al. A successive quadratic programming algorithm with global and superlinear convergence properties , 1986, Math. Program..

[3] P. Boggs,et al. On the Local Convergence of Quasi-Newton Methods for Constrained Optimization , 1982 .

[4] Wenyu Sun,et al. Newton's method and quasi-Newton - SQP method for general LC1 constrained optimization , 1998, Appl. Math. Comput..

[5] M. J. D. Powell,et al. THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS , 1978 .

[6] F. Clarke. Optimization And Nonsmooth Analysis , 1983 .

[7] Andrew R. Conn,et al. Nonlinear programming via an exact penalty function: Asymptotic analysis , 1982, Math. Program..

[8] Gonglin Yuan,et al. The Superlinear Convergence of a Modified BFGS-Type Method for Unconstrained Optimization , 2004, Comput. Optim. Appl..

[9] P. Toint,et al. Local convergence analysis for partitioned quasi-Newton updates , 1982 .