A rapid algorithm for a class of linear complementarity problems

DOI10.1016/J.AMC.2006.11.184MaRDI QIDQ2372045zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

numerical resultsalgorithmmatrix splittingvariational inequalitiesprojection methodrobust convergencelinear complementarityproximal point

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

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

Cites work

• scientific article; zbMATH DE number 4147426 (Why is no real title available?)
• scientific article; zbMATH DE number 844464 (Why is no real title available?)
• A class of iterative methods for solving nonlinear projection equations
• A heuristic algorithm for network equilibration
• A modified extragradient method for general monotone variational inequalities
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• Engineering and Economic Applications of Complementarity Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
• Modified Projection-Type Methods for Monotone Variational Inequalities
• Monotone Operators and the Proximal Point Algorithm
• Proximal alternating directions method for structured variational inequalities
• Solution of symmetric linear complementarity problems by iterative methods

Cited in

(13)

• On the convergence regions of generalized accelerated overrelaxation method for linear complementarity problems
• Projective algorithms for solving complementarity problems
• scientific article; zbMATH DE number 776080 (Why is no real title available?)
• A two-level domain decomposition algorithm for linear complementarity problem
• Newton's method for linear complementarity problems
• A Finite Algorithm for Almost Linear Complementarity Problems
• Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
• scientific article; zbMATH DE number 844464 (Why is no real title available?)
• The steepest descent barrier-projective method for linear complementarity problems
• scientific article; zbMATH DE number 2077071 (Why is no real title available?)
• A finite improvement algorithm for the linear complementarity problem
• A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps
• An algorithm for the fast solution of symmetric 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)