A filter SQP algorithm without a feasibility restoration phase

AUTOR(ES)

Shen, Chungen, Xue, Wenjuan, Pu, Dingguo

FONTE

Computational & Applied Mathematics

DATA DE PUBLICAÇÃO

2009

RESUMO

In this paper we present a filter sequential quadratic programming (SQP) algorithm for solving constrained optimization problems. This algorithm is based on the modified quadratic programming (QP) subproblem proposed by Burke and Han, and it can avoid the infeasibility of the QP subproblem at each iteration. Compared with other filter SQP algorithms, our algorithm does not require any restoration phase procedure which may spend a large amount of computation. We underline that global convergence is derived without assuming any constraint qualifications. Preliminary numerical results are reported.

Documentos Relacionados

• A new double trust regions SQP method without a penalty function or a filter
• A filter algorithm for nonlinear semidefinite programming
• A sequential quadratic programming algorithm that combines merit function and filter ideas
• A subdivision algorithm for phase equilibrium calculations at high pressures
• Viabilidade em programação não-linear : restauração e aplicações