Coordinate Descent

Coordinate Descent is a first-order optimization algorithm that iteratively minimizes a multivariate function by sequentially updating one coordinate (or coordinate block) at a time, using only univariate optimization along each coordinate direction while holding others fixed.

1.1K

Publications

118.4K

Citations

2.5K

Authors

789

Institutions

Publications per year

2017–2026

500

Authors

2.5K

  1. PR
    Peter Richtárik

    University of Edinburgh, United Kingdom

    25 publications · 2.3K citations

    20

    h-index

  2. CP
    Cunhua Pan

    Southeast University, China

    16 publications · 2.9K citations

    15

    h-index

  3. MH
    Mingyi Hong

    University of Minnesota, United States

    14 publications · 2.6K citations

    14

    h-index

  4. YZ
    Yuriy Zakharov

    University of York, United Kingdom

    17 publications · 967 citations

    13

    h-index

  5. KW
    Kezhi Wang

    Northumbria University, United Kingdom

    13 publications · 2.1K citations

    13

    h-index

1–5 of 2.5K

Venues

  1. arXiv (Cornell University)

    Repository · 111 publications · 5K citations

    35

    h-index

  2. IEEE Transactions on Signal Processing

    47 publications · 3.5K citations

    33

    h-index

  3. SIAM Journal on Optimization

    27 publications · 5.4K citations

    21

    h-index

  4. IEEE Transactions on Vehicular Technology

    24 publications · 1.3K citations

    20

    h-index

  5. IEEE Transactions on Wireless Communications

    24 publications · 1K citations

    20

    h-index

1–5