A modeling language for mathematical programming
Management Science
An Interior-Point Algorithm for Nonconvex Nonlinear Programming
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part II
Test Examples for Nonlinear Programming Codes
Test Examples for Nonlinear Programming Codes
Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions
Computational Optimization and Applications
A globally convergent primal-dual interior-point filter method for nonlinear programming
Mathematical Programming: Series A and B
Line Search Filter Methods for Nonlinear Programming: Local Convergence
SIAM Journal on Optimization
Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
SIAM Journal on Optimization
Mathematical Programming: Series A and B
Hi-index | 0.00 |
Here we present a performance evaluation of three versions of a primal-dual interior point filter line search method for nonlinear programming. Each entry in the filter relies on three components, the feasibility, centrality and optimality, that are present in the first-order optimality conditions. The versions differ in a set of acceptance conditions that are used to consider a trial iterate to be acceptable to the filter. Performance profiles are used to compare the obtained numerical results in terms of the number of iterations and the number of the optimality measure evaluations.