Semi-infinite Programming
Semi-Infinite Programming is a mathematical optimization problem in which a finite number of decision variables are subject to an infinite number of constraints, typically parameterized over a continuous index set.
455
Publications
17.3K
Citations
650
Authors
361
Institutions
Publications per year
2017–2026
76
Variants
Semi-infinite Optimization
Parents
455
Multiclass multiple kernel learning
Alexander Zien, Cheng Soon Ong · 2007 · 272 citations · Full text
Simple and Efficient Multiple Kernel Learning by Group Lasso
Zenglin Xu, Rong Jin, Haiqin Yang et al. · 2010 · 230 citations
1–5 of 455
650
18
h-index
16
h-index
15
h-index
13
h-index
11
h-index
1–5 of 650
361

University of Alicante
Alicante, Spain
19 h-index
42 publications
1.3K citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
15 h-index
41 publications
990 citations
RWTH Aachen University
Aachen, Germany
13 h-index
26 publications
961 citations
National Cheng Kung University
Tainan City, Taiwan
12 h-index
12 publications
280 citations

University of Twente
Enschede, The Netherlands
11 h-index
15 publications
793 citations
Curtin University
Perth, Australia
11 h-index
16 publications
579 citations

UNSW Sydney
Sydney, Australia
10 h-index
15 publications
552 citations
Georgia Institute of Technology
Atlanta, United States
10 h-index
10 publications
451 citations
1–8 of 361
41 publications · 1.7K citations
26
h-index
30 publications · 1.4K citations
23
h-index
26 publications · 896 citations
19
h-index
38 publications · 1.1K citations
19
h-index
22 publications · 811 citations
17
h-index
1–5