Projected subgradient method 2026-09-28
The projected subgradient method minimizes a possibly nonsmooth convex function over a closed convex set by iterating with . Nonexpansiveness of Euclidean projection onto a convex set and the subgradient inequality give its basic convergence bound.
Projections onto convex sets 2026-10-14
Projections onto convex sets is an iterative feasibility method that successively applies a Euclidean projection onto a convex set to each closed convex constraint set. With two sets it uses . It seeks a point in the intersection; a single projection onto one set is a different operation, and the method does not generally compute the closest intersection point to the initial iterate.