Convex Cones
Convex Cones is a subset of a vector space that is closed under linear combinations with non-negative coefficients, distinguishing it from general convex sets by containing all non-negative scalar multiples and sums of its elements.
1.5K
Publications
70.8K
Citations
2K
Authors
952
Institutions
Publications per year
2017–2026
141
Parents
1.5K
Applications of second-order cone programming
Miguel Sousa Lobo, Lieven Vandenberghe, Stephen Boyd et al. · Linear Algebra and its Applications · 1998 · 2.4K citations
Containment Control in Mobile Networks
M. Ji, Giancarlo Ferrari‐Trecate, Magnus Egerstedt et al. · IEEE Transactions on Automatic Control · 2008 · 802 citations · Full text
1–5 of 1.5K
2K
14
h-index
12
h-index
Instituto Nacional de Matemática Pura e Aplicada, Brazil
12 publications · 252 citations
11
h-index
10
h-index
10
h-index
1–5 of 2K
952

Centre National de la Recherche Scientifique
Paris, France
19 h-index
40 publications
5.7K citations
University of Wisconsin–Madison
Madison, United States
16 h-index
28 publications
1.5K citations
Massachusetts Institute of Technology
Cambridge, United States
15 h-index
23 publications
1.7K citations
University of Washington
Seattle, United States
14 h-index
20 publications
1.8K citations

University of Waterloo
Waterloo, Canada
14 h-index
26 publications
903 citations
Technion – Israel Institute of Technology
Haifa, Israel
14 h-index
23 publications
960 citations

Université d'Avignon et des Pays de Vaucluse
Avignon, France
13 h-index
20 publications
518 citations

Instituto Nacional de Matemática Pura e Aplicada
Rio de Janeiro, Brazil
12 h-index
13 publications
266 citations
1–8 of 952
64 publications · 2.7K citations
26
h-index
45 publications · 2.1K citations
26
h-index
48 publications · 2.3K citations
26
h-index
39 publications · 1.7K citations
26
h-index
58 publications · 4.3K citations
24
h-index
1–5