Linear Complementarity Problems
Linear Complementarity Problems is a mathematical optimization framework that belongs to the class of complementarity problems, distinguished by its requirement that a solution must satisfy a system of linear inequalities and a complementary slackness condition between non-negative vectors.
1.2K
Publications
61.1K
Citations
1.4K
Authors
670
Institutions
Publications per year
2017–2026
175
Variants
Lcp
Parents
1.2K
Martin Herceg, Michal Kvasnica, Colin N. Jones et al. · 2013 · 1.2K citations · Full text
Engineering, Computational Engineering, Computational Mechanics +13
1–5 of 1.2K
1.4K
28
h-index
22
h-index
University of Maryland, Baltimore County, United States
17 publications · 823 citations
17
h-index
16
h-index
16
h-index
1–5 of 1.4K
670
University of Wisconsin–Madison
Madison, United States
29 h-index
57 publications
6.4K citations

Chinese Academy of Sciences
Beijing, China
22 h-index
40 publications
2.8K citations
University of Maryland, Baltimore County
Baltimore, United States
19 h-index
34 publications
1.4K citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
18 h-index
28 publications
1.3K citations
Stanford University
Stanford, United States
18 h-index
33 publications
3.9K citations

Kyoto University
Kyoto, Japan
16 h-index
27 publications
2.5K citations
Eindhoven University of Technology
Eindhoven, The Netherlands
15 h-index
25 publications
1K citations
South China Normal University
Guangzhou, China
15 h-index
30 publications
1.1K citations
1–8 of 670
108 publications · 6.9K citations
46
h-index
89 publications · 4.2K citations
34
h-index
67 publications · 4.8K citations
34
h-index
38 publications · 1.5K citations
25
h-index
35 publications · 1.5K citations
24
h-index
1–5