A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps

DOI10.1155/2020/8881915zbMath1474.90466OpenAlexW3118172406MaRDI QIDQ2657242

Yamna Achik, Asmaa Idmbarek, Hajar Nafia, Imane Agmour, Youssef EL Foutayeni

Publication date: 12 March 2021

Published in: Abstract and Applied Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/8881915

Mathematics Subject Classification ID

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

Related Items (1)

Interrelationships between prey and predators and how predators choose their prey to maximize their utility functions

Cites Work

• A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• NP-completeness of the linear complementarity problem
• An \((m+1)\)-step iterative method of convergence order \((m+2)\) for linear complementarity problems. An \((m+1)\)-step iterative method for LCPs
• On the resolution of monotone complementarity problems
• On hidden \(Z\)-matrix and interior point algorithm
• A generalized Newton method for a class of discrete-time linear complementarity systems
• Modulus-based matrix splitting methods for horizontal linear complementarity problems
• Backward errors of the linear complementarity problem
• Using vector divisions in solving the linear complementarity problem
• George B. Dantzig: a legendary life in mathematical programming
• Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems
• A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• Equivalence of LCP and PLS
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example
• On the preconditioned projective iterative methods for the linear complementarity problems
• Note on a Fundamental Theorem in Quadratic Programming
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones
• Bimatrix Equilibrium Points and Mathematical Programming
• Nonlinear Programs with Positively Bounded Jacobians
• A Probelm in Linear Inequalities
• Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps