A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game (Q6049293)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A sequential ADMM algorithm to find sparse LCP solutions using a lā-lā regularization technique with application in bimatrix game |
scientific article; zbMATH DE number 7750641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game |
scientific article; zbMATH DE number 7750641 |
Statements
A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game (English)
0 references
17 October 2023
0 references
linear complementarity problem
0 references
sequential ADMM
0 references
sparse solution
0 references
lineared subproblem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8373809456825256
0 references
0.8350942730903625
0 references
0.8073226809501648
0 references
