In this paper we modify the original primal-dual interior-point filter method proposed in  for the solution of nonlinear programming problems. We introduce two new optimality filter entries based on the objective function, and thus better suited for the purposes of minimization, and propose conditions for using inexact Hessians. We show that the global convergence properties of the method remain true under such modifications. We also introduce a new optimization solver for the solution of nonlinear programming problems, called ipfilter, based on our primal-dual interior-point filter approach. The numerical results reported show that ipfilter is competitive both in efficiency and robustness and can handle large instances.
Preprint 08-49, Dept. Mathematics, Univ. Coimbra
View A globally convergent primal-dual interior-point filter method for nonlinear programming: new filter optimality measures and computational results