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

Authors

1.4K

  1. JP
    Jong‐Shi Pang

    Johns Hopkins University, United States

    44 publications · 3.7K citations

    28

    h-index

  2. OL
    O. L. Mangasarian

    University of Wisconsin–Madison, United States

    25 publications · 2.3K citations

    22

    h-index

  3. MS
    M. Seetharama Gowda

    University of Maryland, Baltimore County, United States

    17 publications · 823 citations

    17

    h-index

  4. ZH
    Zheng‐Hai Huang

    Tianjin University, China

    21 publications · 878 citations

    16

    h-index

  5. FA
    Florian A. Potra

    University of Iowa, United States

    20 publications · 719 citations

    16

    h-index

1–5 of 1.4K

Venues

  1. Mathematical Programming

    108 publications · 6.9K citations

    46

    h-index

  2. Journal of Optimization Theory and Applications

    89 publications · 4.2K citations

    34

    h-index

  3. SIAM Journal on Optimization

    67 publications · 4.8K citations

    34

    h-index

  4. Mathematics of Operations Research

    38 publications · 1.5K citations

    25

    h-index

  5. Numerical Algorithms

    35 publications · 1.5K citations

    24

    h-index

1–5