Sign in
Generalized modulus-based matrix splitting algorithm with Anderson acceleration strategy for vertical linear complementarity problems.
Dongmei Yu
Yifei Yuan
Yiming Zhang
Pan Bao
Published in:
J. Comput. Appl. Math. (2024)
Keyphrases
</>
linear complementarity problem
dynamic programming
learning algorithm
k means
np hard
expectation maximization
objective function
computational complexity
worst case
sufficient conditions
knapsack problem
globally optimal
distance transform