Polyhedral Convexity
Polyhedral Convexity is a formal framework within convex analysis that characterizes convex sets as the intersection of a finite number of closed half-spaces, thereby distinguishing itself by its representation of convexity through polyhedral structures defined by linear inequalities.
81
Publications
3.7K
Citations
169
Authors
102
Institutions
Publications per year
2017–2026
6
Parents
81
Simultaneous Variable Selection
Berwin A. Turlach, W. N. Venables, Stephen J. Wright · Technometrics · 2005 · 404 citations
Finite Algorithms in Optimization and Data Analysis
Robin B. Lake, M. R. Osborne · Technometrics · 1987 · 173 citations
1–5 of 81
169
2
h-index
2
h-index
2
h-index
Scuola Internazionale Superiore di Studi Avanzati, Italy
2 publications · 131 citations
2
h-index
2
h-index
1–5 of 169
102
University of Wisconsin–Madison
Madison, United States
6 h-index
7 publications
633 citations
Institute of Mathematics
Hanoi, Vietnam
5 h-index
7 publications
149 citations
Vietnam Academy of Science and Technology
Hanoi, Vietnam
3 h-index
4 publications
62 citations
The University of Tokyo
Tokyo, Japan
2 h-index
5 publications
66 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
3 publications
119 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
471 citations
Fudan University
Shanghai, China
2 h-index
3 publications
87 citations
University of Alabama in Huntsville
Huntsville, United States
2 h-index
2 publications
102 citations
1–8 of 102
9 publications · 418 citations
9
h-index
4 publications · 206 citations
4
h-index
3 publications · 106 citations
3
h-index
3 publications · 92 citations
3
h-index
2 publications · 151 citations
2
h-index
1–5