Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems.

Published in: Numer. Algorithms (2021)

Keyphrases

linear complementarity problem
semidefinite
convergence analysis
semidefinite programming
learning algorithm
dynamic programming
sufficient conditions
particle swarm optimization
objective function
globally optimal
interior point
np hard
worst case
convex hull
higher dimensional
convex relaxation