A sequential ADMM algorithm to find sparse LCP solutions using a l2-l1 regularization technique with application in bimatrix game

Feiran Wang, Yuan Yuan, Xiaoquan Wang, Hu Shao, Liang Shen 0005. A sequential ADMM algorithm to find sparse LCP solutions using a l2-l1 regularization technique with application in bimatrix game. J. Computational Applied Mathematics, 437:115470, February 2024. [doi]

@article{WangYWSS24,
  title = {A sequential ADMM algorithm to find sparse LCP solutions using a l2-l1 regularization technique with application in bimatrix game},
  author = {Feiran Wang and Yuan Yuan and Xiaoquan Wang and Hu Shao and Liang Shen 0005},
  year = {2024},
  month = {February},
  doi = {10.1016/j.cam.2023.115470},
  url = {https://doi.org/10.1016/j.cam.2023.115470},
  researchr = {https://researchr.org/publication/WangYWSS24},
  cites = {0},
  citedby = {0},
  journal = {J. Computational Applied Mathematics},
  volume = {437},
  pages = {115470},
}