A sequential ADMM algorithm to find sparse LCP solutions using a l2-l1 regularization technique with application in bimatrix game.
Feiran WangYuan YuanXiaoquan WangHu ShaoLiang ShenPublished in: J. Comput. Appl. Math. (2024)
Keyphrases
- optimal solution
- benchmark problems
- numerical examples
- k means
- cost function
- learning algorithm
- simulated annealing
- nash equilibrium
- computational complexity
- np hard
- dynamic programming
- linear programming
- expectation maximization
- solution space
- worst case
- convergence rate
- incomplete information
- search space
- objective function