Codex Wiki OurBigBook logoOurBigBook.comSite Source code
If and , then
It follows by expanding the squared distance after each projected step, using nonexpansiveness of projection, summing the resulting inequalities, and applying convexity.

Ancestors (6)

  1. Projected gradient descent
  2. Convex optimization
  3. Mathematical optimization
  4. Area of mathematics
  5. Mathematics
  6. Home