Results 111 to 120 of about 867,669 (246)

On tridiagonal linear complementarity problems

open access: yesNumerische Mathematik, 1987
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

Kernel-Based Interior-Point Methods for Cartesian P*(k)-Linear Complementarity Problems over Symmetric Cones

open access: yesCroatian Operational Research Review, 2011
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  

Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems

open access: yesJournal of Computational and Applied Mathematics, 2016
Shiliang Wu, Cuixia Li
semanticscholar   +1 more source

Variational quantum and neural quantum states algorithms for the linear complementarity problem. [PDF]

open access: yesPhilos Trans A Math Phys Eng Sci
De S   +5 more
europepmc   +1 more source

Research progress on multimodal data fusion in forest resource monitoring. [PDF]

open access: yesFront Plant Sci
Wang M   +6 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy