A kind of nonmonotone filter method for nonlinear complementarity problem
From MaRDI portal
Publication:545563
DOI10.1007/s12190-010-0386-7zbMath1220.90140MaRDI QIDQ545563
Publication date: 22 June 2011
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-010-0386-7
90C30: Nonlinear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Cites Work
- Unnamed Item
- Global convergence of nonmonotone descent methods for unconstrained optimization problems
- A nonmonotone filter trust region method for nonlinear constrained optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Nonmonotonic trust region algorithm
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- Nonmonotone adaptive trust-region method for unconstrained optimization problems
- A robust sequential quadratic programming method
- Nonmonotone trust region method for solving optimization problems
- A nonmonotone trust region algorithm for equality constrained optimization
- A nonmonotone trust region algorithm for unconstrained nonsmooth optimization
- A filter method for solving nonlinear complementarity problems
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search I. General Constrained Problems
- Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- Global Methods for Nonlinear Complementarity Problems
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- A new nonmonotone line search technique for unconstrained optimization
- A modified SQP method and its global convergence
- A modified SQP method with nonmonotone linesearch technique.
- Nonlinear programming without a penalty function.
- A new smoothing quasi-Newton method for nonlinear complementarity problems