No CrossRef data available.
Article contents
An active set sequential quadratic programming algorithm for nonlinear optimisation
Published online by Cambridge University Press: 17 April 2009
Extract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
In this paper, we have proposed an active set feasible sequential quadratic programming algorithm for nonlinear inequality constraints optimization problems. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving a reduced quadratic programming subproblem. To overcome the Maratos effect, a higher-order correction direction is obtained by solving a reduced least square problem. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions without strict complementarity.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 2006
References
[1]Boggs, P.T. and Tolle, J.W., ‘Sequential quadratic programming’, Acta Numer. (1995), 1–51.CrossRefGoogle Scholar
[2]Broyden, C.G., Dennis, J.E. and More, J.J., ‘On the local and superlinear convergence of quasi-Newton methods’, J. Inst. Math. Appl. 12 (1973), 223–245.CrossRefGoogle Scholar
[3]Cawood, M.E. and Kostreva, M.M., ‘Norm-relaxed method of feasible directions for solving nonlinear programming problems’, J. Optim. Theory. Appl. 83 (1994), 311–320.CrossRefGoogle Scholar
[4]Chen, X.B., and Kostreva, M.M., ‘A generalization of the norm-relaxed method of feasible directions’, Appl. Math. Comput. 102 (1999), 257–272.CrossRefGoogle Scholar
[5]De, J.F.A., Pantoja, O. and Mayne, D.Q., ‘Exact penalty function algorithm with simple updating of the penalty parameter’, J. Optim. Theory. Appl. 69 (1991), 441–467.Google Scholar
[6]Facchinei, F., ‘Robust recursive quadratic programming algorithm model with global and superlinear convergence properties’, J. Optim. Theory. Appl. 92 (1997), 543–579.CrossRefGoogle Scholar
[7]Facchinei, F., Fischer, A. and Kanzow, C., ‘On the accurate identification of active constraints’, SIAM J. Optim. 9 (1999), 14–32.CrossRefGoogle Scholar
[8]Facchinei, F. and Lucidi, S., ‘Quadratically and superlinearly convergent algorithms for the solution of inequality constrained optimization problems’, J. Optim. Theory. Appl. 85 (1995), 265–289.CrossRefGoogle Scholar
[9]Gao, Z.Y., He, G.P. and Wu, F., ‘A method of sequential systems of linear equations with arbitrary initial point’, Sci. China Ser. A 27 (1997), 24–33.Google Scholar
[10]Han, S.P., ‘A globally convergent method for nonlinear programming’, J. Optim. Theory. Appl. 22 (1977), 297–309.CrossRefGoogle Scholar
[11]Jian, J.B., Researches on superlinearly and quadratically convergent algorithm for nonlinearly constrained optimization, Ph.D.Thesis (School of Xi'an Jiaotong University., Xi'an, China, 2000).Google Scholar
[12]Jian, J.B., ‘Two extension models of SQP and SSLE algorithms for optimization and their superlinear and quadrtical convergence’, Appl. Math. J. Chinese Univ. Ser. A 16 (2001), 435–444.Google Scholar
[13]Jian, J.B., Zhang, K.C. and Xue, S.J., ‘A superlinearly and quadratically convergent SQP type feasible method for constrained optimization’, Appl. Math. J. Chinese Univ. Ser. B 15 (2000), 319–331.Google Scholar
[14]Kostreva, M.M. and Chen, X., ‘A superlinearly convergent method of feasible directions’, Appl. Math. Comput. 116 (2000), 245–255.CrossRefGoogle Scholar
[15]Lawrence, C.T., and Tits, A.L., ‘A computationally efficient feasible sequential quadratic programming algorithm’, SIAM J. Optim. 11 (2001), 1092–1118.CrossRefGoogle Scholar
[16]Lucidi, S., ‘New results on a continuously differentiable penalty function’, SIAM J. Optim. 2 (1992), 558–574.CrossRefGoogle Scholar
[17]Panier, E.R. and Tits, A.L., ‘A superlinearly convergent feasible method for the solution of inequality constrained optimization problems’, SIAM J. Control. Optim. 25 (1987), 934–950.CrossRefGoogle Scholar
[18]Pironneau, O. and Polak, E., ‘On the rate of convergence of certain methods of centers’, Math. Program. 2 (1972), 230–257.CrossRefGoogle Scholar
[19]Pironneau, O. and Polak, E., ‘Rate of convergence of a class of methods of feasible directions’, SIAM J. Numer. Anal. 10 (1973), 161–173.CrossRefGoogle Scholar
[20]Powell, M.J.D., ‘A fast algorithm for nonlinearly constrained optimization calculations’, in Numerical analysis, Lecture Notes in Math. 630, (Proc. 7th Biennial Conf., Univ. Dundee, Dundee, 1977) (Springer-Verlag, Berlin, 1978), pp. 144–157.CrossRefGoogle Scholar
[21]Qi, L. and Yang, Y.F., ‘A Globally and superlinearly convergent SQP algorithm for nonlinear constrained optimization’, AMR00/7, Applied Mathematics Report, University of New South Wales, Sydney, 03 2000.Google Scholar
[22]Spellucci, P., ‘A new technique for inconsistent QP probrems in the SQP methods’, Math. Methods. Oper. Res. 47 (1998), 355–400.CrossRefGoogle Scholar
[23]Topkis, D.M. and Veinott, A.F., ‘On the convergence of some feasible direction algorithms for nonlinear programming’, SIAM J. Control. 5 (1967), 268–279.CrossRefGoogle Scholar
[24]Wright, S.J., ‘Superlinear convergence of a stabilized SQP method to a degenerate solution’, Comput. Optim. Appl. 11 (1998), 253–275.CrossRefGoogle Scholar
[25]Zhu, Z., ‘An efficient sequential quadratic programming algorithm for nonlinear programming’, J. Comput. Appl. Math. 175 (2005), 447–464.CrossRefGoogle Scholar
You have
Access