Equality-constrained Quadratic Programming

Equality-Constrained Quadratic Programming is a subclass of quadratic programming problems in which the objective function is minimized subject to a set of linear equality constraints only, distinguishing it from other quadratic programming variants by the absence of inequality constraints.

116

Publications

6K

Citations

223

Authors

139

Institutions

Publications per year

2017–2026

25

Variants

Eqp

Authors

223

  1. YZ
    Yunong Zhang

    Sun Yat-sen University, China

    8 publications · 785 citations

    8

    h-index

  2. LJ
    Long Jin

    Lanzhou University, China

    5 publications · 858 citations

    5

    h-index

  3. ZD
    Zdeněk Dostál

    VSB - Technical University of Ostrava, Czechia

    5 publications · 183 citations

    5

    h-index

  4. LX
    Lin Xiao

    Hunan Normal University, China

    4 publications · 193 citations

    4

    h-index

  5. ZZ
    Zhijun Zhang

    South China University of Technology, China

    3 publications · 128 citations

    3

    h-index

1–5 of 223

Venues

  1. SIAM Journal on Optimization

    7 publications · 304 citations

    7

    h-index

  2. 7

    h-index

  3. 4

    h-index

  4. Neurocomputing

    4 publications · 246 citations

    4

    h-index

  5. Mathematical Programming

    3 publications · 246 citations

    3

    h-index

1–5