Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T05:42:36.425Z Has data issue: false hasContentIssue false

An active set sequential quadratic programming algorithm for nonlinear optimisation

Published online by Cambridge University Press:  17 April 2009

Qing-Jie Hu
Affiliation:
Institute of Applied Mathematics, Hunan University, 410082 Changsha, Peoples Republic China, Department of Information, Hunan Business College, 410205 Changsha, Peoples Republic of China, e-mail: hqj0525@126.com.cn
Yun-Hai Xiao
Affiliation:
Institute of Applied Mathematics, Hunan University, 410082 Changsha, Peoples Republic China
Y. Chen
Affiliation:
Department of Information, Hunan Business College, 410205 Changsha, Peoples Republic of China
Rights & Permissions [Opens in a new window]

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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 2006