Fix with nonempty subdifferential for a convex function . If and , monotonicity of a convex subdifferential gives for any fixed . Hence
The Cauchy-Schwarz inequality proves the bound uniformly for . If has an -Lipschitz gradient, this makes the remainder in the proximal gradient mapping descent bound at most . Thus the big O notation is justified despite the dependence of the proximal gradient mapping on .
Target: convex-optimization.bigb, under Coordinate descent.

Articles by others on the same topic (0)

There are currently no matching articles.