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

Authors

169

  1. ND
    Nguyen Dong Yen

    Institute of Mathematics, Vietnam

    2 publications · 34 citations

    2

    h-index

  2. BD
    Bart De Schutter

    Delft University of Technology, Netherlands

    2 publications · 121 citations

    2

    h-index

  3. AS
    Akiyoshi Shioura

    Tohoku University, Japan

    2 publications · 72 citations

    2

    h-index

  4. GD
    Gianni Dal Maso

    Scuola Internazionale Superiore di Studi Avanzati, Italy

    2 publications · 131 citations

    2

    h-index

  5. OL
    O. L. Mangasarian

    University of Wisconsin–Madison, United States

    2 publications · 144 citations

    2

    h-index

1–5 of 169

Venues

  1. Mathematical Programming

    9 publications · 418 citations

    9

    h-index

  2. Mathematics of Operations Research

    4 publications · 206 citations

    4

    h-index

  3. SIAM Journal on Optimization

    3 publications · 106 citations

    3

    h-index

  4. Optimization

    3 publications · 92 citations

    3

    h-index

  5. Discrete Applied Mathematics

    2 publications · 151 citations

    2

    h-index

1–5