A filter algorithm: comparison with NLP solvers
DOI10.1080/00207160701203401zbMATH Open1138.65048OpenAlexW2047499270WikidataQ114857760 ScholiaQ114857760MaRDI QIDQ5459749FDOQ5459749
Authors: Cândida Elisa P. Silva, M. Teresa T. Monteiro 
Publication date: 29 April 2008
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1822/17109
Recommendations
- A filter inexact-restoration method for nonlinear programming
- A filter algorithm and other NLP solvers: performance comparative analysis
- A two step filter SQP algorithm for nonlinear constrained optimization
- Global Convergence of Filter Methods for Nonlinear Programming
- A Globally Convergent Filter Method for Nonlinear Programming
nonlinear programmingnumerical examplesalgorithmline searchfilter methodnonlinear constrained optimizationinexact restoration
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Benchmarking optimization software with performance profiles.
- Nonlinear programming without a penalty function.
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Inexact-restoration algorithm for constrained optimization
- A Globally Convergent Filter Method for Nonlinear Programming
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- Local convergence of an inexact-restoration method and numerical experiments
- LOQO user's manual — version 3.10
Cited In (3)
Uses Software
This page was built for publication: A filter algorithm: comparison with NLP solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459749)
