Conic Optimization
Conic Optimization is a subfield of convex optimization that involves minimizing a linear objective function over the intersection of an affine subspace and a closed convex cone, thereby generalizing linear, second-order, and semidefinite programming within a unified framework.
410
Publications
30.2K
Citations
731
Authors
362
Institutions
Publications per year
2017–2026
116
Parents
410
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
ECOS: An SOCP solver for embedded systems
Alexander Domahidi, Eric Chu, Stephen Boyd · 2013 · 728 citations
1–5 of 410
731
11
h-index
10
h-index
9
h-index
9
h-index
8
h-index
1–5 of 731
362
Massachusetts Institute of Technology
Cambridge, United States
19 h-index
40 publications
2.2K citations
National University of Singapore
Singapore, Singapore
15 h-index
33 publications
3.1K citations
University of California, Berkeley
Berkeley, United States
15 h-index
36 publications
7.3K citations
California Institute of Technology
Pasadena, United States
11 h-index
19 publications
4.7K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
10 h-index
17 publications
1.7K citations
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
18 publications
4.7K citations
Columbia University
New York, United States
10 h-index
16 publications
916 citations

Tilburg University
Tilburg, The Netherlands
7 h-index
9 publications
614 citations
1–8 of 362
39 publications · 2.9K citations
27
h-index
26 publications · 2.3K citations
20
h-index
19 publications · 3.3K citations
17
h-index
Repository · 16 publications · 368 citations
13
h-index
13 publications · 1.1K citations
12
h-index
1–5