Stochastic Convex Optimization

Stochastic Convex Optimization is a subfield of mathematical optimization that addresses convex problems involving objective functions or constraints subject to random noise, where the solution process incorporates stochasticity through iterative methods that utilize random samples to approximate gradients or function values.

455

Publications

31.4K

Citations

802

Authors

354

Institutions

Publications per year

2017–2026

234

Authors

802

  1. AG
    Alexander Gasnikov

    Moscow Institute of Physics and Technology, Russia

    17 publications · 489 citations

    13

    h-index

  2. PR
    Peter Richtárik

    University of Edinburgh, United Kingdom

    16 publications · 570 citations

    13

    h-index

  3. JC
    John C. Duchi

    Stanford University, United States

    13 publications · 9.8K citations

    13

    h-index

  4. TY
    Tianbao Yang

    University of Iowa, United States

    11 publications · 287 citations

    10

    h-index

  5. OS
    Ohad Shamir

    Weizmann Institute of Science, Israel

    10 publications · 1.3K citations

    10

    h-index

1–5 of 802

Venues

  1. arXiv (Cornell University)

    Repository · 128 publications · 5.3K citations

    32

    h-index

  2. SIAM Journal on Optimization

    27 publications · 2.5K citations

    23

    h-index

  3. Mathematical Programming

    16 publications · 1.1K citations

    13

    h-index

  4. IEEE Transactions on Automatic Control

    10 publications · 458 citations

    10

    h-index

  5. Neural Information Processing Systems

    Conference · 11 publications · 481 citations

    10

    h-index

1–5