A rapid algorithm for a class of linear complementarity problems
DOI10.1016/J.AMC.2006.11.184zbMATH Open1125.65054OpenAlexW2092503368MaRDI QIDQ2372045FDOQ2372045
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
Recommendations
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Projective algorithms for solving complementarity problems
- Publication:4865357
- A self-adaptive projection and contraction method for linear complementarity problems
- A class of new modulus-based matrix splitting methods for linear complementarity problem
numerical resultsalgorithmmatrix splittingvariational inequalitiesprojection methodrobust convergencelinear complementarityproximal point
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Monotone Operators and the Proximal Point Algorithm
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Engineering and Economic Applications of Complementarity Problems
- Solution of symmetric linear complementarity problems by iterative methods
- A class of iterative methods for solving nonlinear projection equations
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proximal alternating directions method for structured variational inequalities
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- A modified extragradient method for general monotone variational inequalities
- A heuristic algorithm for network equilibration
Cited In (11)
- Title not available (Why is that?)
- Projective algorithms for solving complementarity problems
- Newton's method for linear complementarity problems
- A Finite Algorithm for Almost Linear Complementarity Problems
- Title not available (Why is that?)
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
- The steepest descent barrier-projective method for linear complementarity problems
- Title not available (Why is that?)
- A finite improvement algorithm for the linear complementarity problem
- An algorithm for the fast solution of symmetric linear complementarity problems
- On the convergence regions of generalized accelerated overrelaxation method for linear complementarity problems
This page was built for publication: A rapid algorithm for a class of linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372045)
