Operations research, mathematical programming Convex programming and duality Concept
Proximal operator
Summary
The proximal operator of a convex function on a Hilbert space sends a point to a nearby point where is small. The new point minimizes , which balances the two aims. It generalizes the projection onto a closed convex set, which is the proximal operator of the indicator function of the set. Proximal operators are firmly nonexpansive, and they are the building blocks of proximal gradient methods and other splitting algorithms in convex optimization.
Further reading
About this page
| Tag | E239APE78P |
|---|---|
| URI | m2://E239APE78P |
| Kind | concept |
| Writing | W0 stub |
| MSC | 90C25, 47H09, 49J53 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.