A sequential quadratic programming algorithm that combines merit function and filter ideas

AUTOR(ES)

Gomes, Francisco A.M.

FONTE

Computational & Applied Mathematics

DATA DE PUBLICAÇÃO

2007

RESUMO

A sequential quadratic programming algorithm for solving nonlinear programming problems is presented. The new feature of the algorithm is related to the definition of the merit function. Instead of using one penalty parameter per iteration and increasing it as the algorithm progresses, we suggest that a new point is to be accepted if it stays sufficiently below the piecewise linear function defined by some previous iterates on the (f,||C||2²)-space. Therefore, the penalty parameter is allowed to decrease between successive iterations. Besides, one need not to decide how to update the penalty parameter. This approach resembles the filter method introduced by Fletcher and Leyffer [Math. Program., 91 (2001), pp. 239-269], but it is less tolerant since a merit function is still used. Numerical comparison with standard methods shows that this strategy is promising.

Documentos Relacionados

• A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm
• STABILIZED SEQUENTIAL QUADRATIC PROGRAMMING: A SURVEY
• A filter algorithm for nonlinear semidefinite programming
• Sequential quadratic programming and constraint qualification
• Solving the unit commitment problem of hydropower plants via Lagrangian Relaxation and Sequential Quadratic Programming