A filter method for solving nonlinear complementarity problems
DOI10.1016/j.amc.2004.06.125zbMath1082.65062OpenAlexW2102223648WikidataQ57806904 ScholiaQ57806904MaRDI QIDQ2570745
Publication date: 28 October 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2004.06.125
global convergencenumerical resultsnonlinear programmingtrust region methodnonlinear complementarity problemssuccessive quadratic programmingfilter methodsmulti-objective problemspattern search methodcomposite-like methodsinterior point strategy
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51) Methods of successive quadratic programming type (90C55)
Related Items (19)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- On the global convergence of an SLP-filter algorithm that takes EQP steps
- A null space method for solving system of equations.
- On the resolution of monotone complementarity problems
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the superlinear local convergence of a filter-SQP method
- On the convergence of a new trust region algorithm
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- A Pattern Search Filter Method for Nonlinear Programming without Derivatives
- Global Methods for Nonlinear Complementarity Problems
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Nonlinear programming without a penalty function.
This page was built for publication: A filter method for solving nonlinear complementarity problems