Proximal Algorithms

Proximal Algorithms is a class of iterative optimization methods that solve complex minimization problems by sequentially applying proximity operators to handle non-smooth or constrained components of the objective function.

1.6K

Publications

108K

Citations

2.6K

Authors

973

Institutions

Publications per year

2017–2026

768

Variants

Proximal Methods

Authors

2.6K

  1. MT
    Marc Teboulle

    Tel Aviv University, Israel

    20 publications · 4.5K citations

    19

    h-index

  2. JY
    Jen‐Chih Yao

    National Sun Yat-sen University, Taiwan

    22 publications · 775 citations

    18

    h-index

  3. PR
    Paulo Roberto Oliveira

    Universidade Federal do Rio de Janeiro, Brazil

    22 publications · 1K citations

    17

    h-index

  4. BF
    B. F. Svaiter

    Instituto Nacional de Matemática Pura e Aplicada, Brazil

    18 publications · 3.3K citations

    16

    h-index

  5. KC
    Krzysztof C. Kiwiel

    Systems Research Institute, Poland

    16 publications · 1.4K citations

    16

    h-index

1–5 of 2.6K

Venues

  1. SIAM Journal on Optimization

    108 publications · 10.3K citations

    53

    h-index

  2. Mathematical Programming

    71 publications · 12.6K citations

    40

    h-index

  3. arXiv (Cornell University)

    Repository · 160 publications · 17.2K citations

    38

    h-index

  4. Journal of Optimization Theory and Applications

    81 publications · 3.3K citations

    29

    h-index

  5. Computational Optimization and Applications

    51 publications · 2.2K citations

    27

    h-index

1–5