Recently, Fletcher and Leyffer proposed using filter methods instead of a merit function to control steplengths in a sequential quadratic programming algorithm. In this paper, we analyze possible ways to implement a filter-based approach in an interior-point algorithm. Extensive numerical testing shows that such an approach is more efficient than using a merit function alone.
机构:
Univ Nova Lisboa, CMA, Dept Math, Fac Sci & Technol, P-2829516 Quinta Da Torre, Caparica, PortugalUniv Nova Lisboa, CMA, Dept Math, Fac Sci & Technol, P-2829516 Quinta Da Torre, Caparica, Portugal