Results 81 to 90 of about 880,886 (232)
For the large and sparse linear complementarity problem, we provide a family of new accelerated modulus-based iteration methods in this article. We provide some sufficient criteria for the convergence analysis when the system matrix is a \(P\)-matrix ...
Bharat Kumar, Deepmala, A. K. Das
doaj +1 more source
A new algorithm for the linear complementarity problem allowing for an arbitrary starting point [PDF]
Linear ...
Kremers, J.A.W.M., Talman, A.J.J.
core +1 more source
A class of new modulus-based matrix splitting methods for linear complementarity problem
Shiliang Wu, Cuixia Li
semanticscholar +1 more source
MULTIPLE OPTIMAL SOLUTIONS IN QUADRATIC PROGRAMMING MODELS [PDF]
The problem of determining whether quadratic programming models possess either unique or multiple optimal solutions is important for empirical analyses which use a mathematical programming framework.
Paris, Quirino
core +1 more source
A New Full-Newton Step $O(n)$ Infeasible Interior-Point Algorithm for $P_*(\kappa)$-horizontal Linear Complementarity Problems [PDF]
In this paper, we first present a brief review about the feasible interior-point algorithm for $P_*(\kappa)$-horizontal linear complementarity problems (HLCPs) based on new directions.
Soodabeh Asadi, Hossein Mansouri
doaj
On tridiagonal linear complementarity problems
The author proposes an iterative algorithm for solving linear complementarity problems with symmetric positive definite tridiagonal matrices. Such problems are well known to be equivalent to strictly convex quadratic programs whose constraints consist exclusively of simple lower bounds on all the variables. The linear complementarity problems with such
openaire +1 more source
This study proposes a motion analysis method for human-machine systems involving contact phenomena. When human skin comes into surface contact with objects, the flexibility of the skin and the friction between the epidermis and the object can result in ...
Yuki KITAZAWA +3 more
doaj +1 more source
Linear complementarity problems solvable as linear programs
In this paper, we present a theoretical and numerical study of linear complementary problems solvable as linear programs. We give several examples of linear complementarity problems which can be solved as linear programs using linear programming appraoches. Also, we propose two examples solved by the simplex and Karmarkar's method, while the most
openaire +3 more sources
A general preconditioner for linear complementarity problem with an M-matrix
Pingfan Dai +3 more
semanticscholar +1 more source
Variational quantum and neural quantum states algorithms for the linear complementarity problem. [PDF]
De S +5 more
europepmc +1 more source

