OurBigBook About$ Donate
 Sign in Sign up

Coordinate descent

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization Convex optimization
Created 2026-09-24 Updated 2026-10-03  0 By others on same topic  0 Discussions Create my own version
Coordinate descent minimizes an objective by repeatedly optimizing one coordinate, or one block of coordinates, while holding all others fixed. Exact coordinate minimization is especially simple for separable penalties and quadratic objectives.

 Ancestors (5)

  1. Convex optimization
  2. Mathematical optimization
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (6)

  • Cyclic substitution for the Erlang fixed point
  • Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 45 / 1 / a / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 39 / 2 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 205 / 4 / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 218 / 5 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 218 / 2 / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook