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
Parents
116
1–5 of 116
223
8
h-index
5
h-index
5
h-index
4
h-index
3
h-index
1–5 of 223
139

Sun Yat-sen University
Guangzhou, China
7 h-index
24 publications
1.7K citations
VSB - Technical University of Ostrava
Ostrava, Czechia
4 h-index
8 publications
179 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
4 h-index
6 publications
883 citations
Lanzhou University
Lanzhou, China
3 h-index
6 publications
434 citations
University of Cambridge
Cambridge, United Kingdom
2 h-index
3 publications
163 citations

Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
2 h-index
3 publications
174 citations
Jishou University
Zhangjiajie, China
2 h-index
2 publications
286 citations

East China Normal University
Shanghai, China
2 h-index
2 publications
70 citations
1–8 of 139
7 publications · 304 citations
7
h-index
7 publications · 160 citations
7
h-index
4 publications · 86 citations
4
h-index
4 publications · 246 citations
4
h-index
3 publications · 246 citations
3
h-index
1–5