scientific article
From MaRDI portal
Publication:3632456
zbMath1176.47051MaRDI QIDQ3632456
Patrick L. Combettes, Heinz H. Bauschke
Publication date: 11 June 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
resolventmaximal monotone operatorsubdifferentials of convex functionsDykstra's algorithmproximity operatorvon Neumann's algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods involving duality (49M29) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25)
Related Items (22)
Parallel algorithms for variational inclusions and fixed points with applications ⋮ Proximal Splitting Methods in Signal Processing ⋮ Computing the resolvent of composite operators ⋮ Entropic Approximation of Wasserstein Gradient Flows ⋮ Monotone operator theory in convex optimization ⋮ Approximating iterations for nonexpansive and maximal monotone operators ⋮ A splitting method for finding the resolvent of the sum of two maximal monotone operators ⋮ Convex biclustering ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ Dualization of signal recovery problems ⋮ Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm ⋮ Computing the resolvent of the sum of operators with application to best approximation problems ⋮ Inexact proximal stochastic gradient method for convex composite optimization ⋮ Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences ⋮ An iterated projection approach to variational problems under generalized convexity constraints ⋮ Proximity for sums of composite functions ⋮ Group Regularized Estimation Under Structural Hierarchy ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Iterative methods for computing the resolvent of the sum of a maximal monotone operator and composite operator with applications ⋮ A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions ⋮ Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions ⋮ Iterative Bregman Projections for Regularized Transportation Problems
This page was built for publication:
