Convex Feasibility Problems

Convex Feasibility Problems is a class of mathematical optimization problems in which the goal is to find a point in the intersection of a finite number of closed convex sets, distinguishing it from other optimization problems by focusing solely on feasibility rather than minimizing an objective function.

528

Publications

33.5K

Citations

923

Authors

497

Institutions

Publications per year

2017–2026

117

Variants

Convex Feasibility Problem

Authors

923

  1. YC
    Yair Censor

    University of Haifa, Israel

    28 publications · 2.9K citations

    21

    h-index

  2. HH
    Heinz H. Bauschke

    University of British Columbia, Okanagan Campus, Canada

    13 publications · 2.4K citations

    11

    h-index

  3. PL
    Patrick L. Combettes

    Laboratoire Jacques-Louis Lions, France

    10 publications · 915 citations

    10

    h-index

  4. YS
    Yekini Shehu

    Zhejiang Normal University, China

    9 publications · 283 citations

    9

    h-index

  5. SR
    Simeon Reich

    Technion – Israel Institute of Technology, Israel

    8 publications · 599 citations

    8

    h-index

1–5 of 923

Venues

  1. SIAM Journal on Optimization

    49 publications · 4.1K citations

    31

    h-index

  2. Journal of Optimization Theory and Applications

    24 publications · 852 citations

    19

    h-index

  3. Mathematical Programming

    25 publications · 1.3K citations

    18

    h-index

  4. Optimization

    21 publications · 925 citations

    16

    h-index

  5. IEEE Transactions on Signal Processing

    15 publications · 1.9K citations

    15

    h-index

1–5