Using vector divisions in solving the linear complementarity problem
From MaRDI portal
Publication:2428109
DOI10.1016/j.cam.2011.11.001zbMath1238.65053MaRDI QIDQ2428109
Mohamed Khaladi, Youssef EL Foutayeni
Publication date: 24 April 2012
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.11.001
global convergence; Newton's method; numerical examples; linear complementarity problem; secant method; hybrid algorithm; vector division
65K05: Numerical mathematical programming methods
65H10: Numerical computation of solutions to systems of equations
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
An accelerated Newton method of high-order convergence for solving a class of weakly nonlinear complementarity problems, A new matrix splitting generalized iteration method for linear complementarity problems, A new smoothing nonlinear conjugate gradient method for nonsmooth equations with finitely many maximum functions, A generalized Newton method of high-order convergence for solving the large-scale 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, Interrelationships between prey and predators and how predators choose their prey to maximize their utility functions, A fast algorithm for solving a class of the linear complementarity problem in a finite number of steps, A representation of the solution set of a class of linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior point algorithm for \(P_*\) nonlinear complementarity problems
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- On the modulus algorithm for the linear complementarity problem.
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Exponential time integration for fast finite element solutions of some financial engineering problems
- Q-matrices and spherical geometry
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- George B. Dantzig: a legendary life in mathematical programming
- Engineering and Economic Applications of Complementarity Problems
- Iterative Solution of Nonlinear Equations in Several Variables
- Equilibrium Points of Bimatrix Games
- Bimatrix Equilibrium Points and Mathematical Programming
- A Probelm in Linear Inequalities
- On a Characterization ofP-Matrices
- A Partition Theorem for Euclidean n-Space