Neal Parikh coauthored an exposition of the proximal point algorithm with Stephen Boyd. A proximal operator replaces a difficult nonsmooth minimization step with a quadratic-regularized subproblem. Their account connects this operation with convex projection, resolvents and splitting methods, allowing nonsmooth objectives and constraints to be treated within a common algorithmic framework.[ref]
New to topics? Read the docs here!