Conic Programming
Conic Programming is a type of mathematical optimization problem in which the objective is to minimize a linear function over the intersection of an affine subspace and a convex cone, distinguished from other optimization frameworks by its reliance on conic constraints that generalize linear, quadratic, and semidefinite programming.
430
Publications
33.3K
Citations
783
Authors
384
Institutions
Publications per year
2017–2026
139
Parents
430
Multiple kernel learning, conic duality, and the SMO algorithm
Francis Bach, Gert Lanckriet, Michael I. Jordan · 2004 · 1.4K citations
Large Scale Multiple Kernel Learning
Sören Sonnenburg, Gunnar Rätsch, Christin Schäfer et al. · MPG.PuRe (Max Planck Society) · 2006 · 1.2K citations · Full text
Anthony Man–Cho So, Tsung‐Hui Chang, Wing‐Kin Ma et al. · IEEE Transactions on Signal Processing · 2014 · 875 citations
Natural Sciences, Electrical Engineering, Digital Communication +16
1–5 of 430
783
14
h-index
10
h-index
10
h-index
9
h-index
8
h-index
1–5 of 783
384

Imperial College London
London, United Kingdom
16 h-index
36 publications
4.6K citations
University of California, Berkeley
Berkeley, United States
15 h-index
35 publications
7.5K citations
Massachusetts Institute of Technology
Cambridge, United States
15 h-index
33 publications
3.4K citations
National University of Singapore
Singapore, Singapore
14 h-index
29 publications
2.9K citations
California Institute of Technology
Pasadena, United States
11 h-index
20 publications
4.8K citations
Carnegie Mellon University
Pittsburgh, United States
10 h-index
13 publications
641 citations

American University of Beirut
Beirut, Lebanon
9 h-index
10 publications
1K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
9 h-index
15 publications
2.6K citations
1–8 of 384
35 publications · 3.1K citations
26
h-index
23 publications · 4.2K citations
21
h-index
26 publications · 2.2K citations
20
h-index
15 publications · 1.8K citations
14
h-index
Repository · 14 publications · 364 citations
13
h-index
1–5