= Neal Parikh
{c}
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.<Proximal Algorithms by Neal Parikh and Stephen Boyd>[Sections 1.1–1.2, 3.2 and 4.2–4.3]{ref}
Back to article page
