A rapid algorithm for a class of linear complementarity problems
From MaRDI portal
Publication:2372045
DOI10.1016/j.amc.2006.11.184zbMath1125.65054MaRDI QIDQ2372045
Publication date: 10 July 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.11.184
algorithm; variational inequalities; numerical results; linear complementarity; projection method; matrix splitting; proximal point; robust convergence
65K05: Numerical mathematical programming methods
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems, On the convergence regions of generalized accelerated overrelaxation method for linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Solution of symmetric linear complementarity problems by iterative methods
- A class of iterative methods for solving nonlinear projection equations
- A modified extragradient method for general monotone variational inequalities
- Proximal alternating directions method for structured variational inequalities
- A heuristic algorithm for network equilibration
- Monotone Operators and the Proximal Point Algorithm
- Engineering and Economic Applications of Complementarity Problems
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
