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
We present an interior point method for Cartesian P*(k)-Linear Complementarity Problems over Symmetric Cones (SCLCPs). The Cartesian P*(k)-SCLCPs have been recently introduced as the generalization of the more commonly known and more widely used monotone
Goran Lešaja
doaj
Interior-point methods for monotone linear complementarity problems based on the new kernel function with applications to control tabular adjustment problem. [PDF]
Lesaja G +4 more
europepmc +1 more source
Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
Shiliang Wu, Cuixia Li
semanticscholar +1 more source
Data-driven acceleration of mixed-integer bilinear programs: a comparative study for robot motion planning. [PDF]
Lin X.
europepmc +1 more source
Variational quantum and neural quantum states algorithms for the linear complementarity problem. [PDF]
De S +5 more
europepmc +1 more source
Calculation of Robot Multi-Fingered Grasping Force and Displacement Based on the Newton-Subgradient Non-Smooth Greedy Randomized Kaczmarz Method for Solving Linear Complementarity Problem. [PDF]
Ai Z, Li C.
europepmc +1 more source
Non-linearity, complexity, and quantization concepts in biology. [PDF]
Theise ND, Tuszynski JA.
europepmc +1 more source
Research progress on multimodal data fusion in forest resource monitoring. [PDF]
Wang M +6 more
europepmc +1 more source

