A Finite Algorithm for Almost Linear Complementarity Problems
From MaRDI portal
Publication:5438288
DOI10.1080/01630560701749714zbMath1138.90034OpenAlexW1969028822MaRDI QIDQ5438288
Publication date: 23 January 2008
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560701749714
Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interval and finite arithmetic (65G30)
Related Items
Quadratic convergence of monotone iterates for semilinear elliptic obstacle problems, Components identification based method for box constrained variational inequality problems with almost linear functions, Finite algorithms for the numerical solutions of a class of nonlinear complementarity problems
Uses Software
Cites Work
- Unnamed Item
- Enclosing solutions of linear complementarity problems for H-matrices
- Finite element approximation of a model reaction-diffusion problem with a non-Lipschitz nonlinearity
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- M-matrix characterizations. I: nonsingular M-matrices
- Interfaces to PATH 3.0: Design, implementation and usage
- Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
- Interval analysis: Theory and applications
- The Semismooth Algorithm for Large Scale Complementarity Problems
- Interval Methods for Systems of Equations
- A Test for Existence of Solutions to Nonlinear Systems
- A special newton-type optimization method
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A regularized projection method for complementarity problems with non-Lipschitzian functions
