OurBigBook About$ Donate
 Sign in Sign up

Averaged projected-gradient bound

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization Convex optimization Projected gradient descent
Created 2026-09-24 Updated 2026-09-28  0 By others on same topic  0 Discussions Create my own version
If ∥∇F(xi​)∥≤G and ∥x1​−x∗​∥≤D, then
F(k1​∑i=1k​xi​)−F(x∗​)≤2ηkD2​+2ηG2​.
(1)
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

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2025 / ii / Paper 4 / 30L / 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