Proximity for sums of composite functions

DOI10.1016/j.jmaa.2011.02.079zbMath1223.47120arXiv1007.3535OpenAlexW1972440447MaRDI QIDQ536271

Patrick L. Combettes, Băng Công Vũ, Dinh Dung

Publication date: 16 May 2011

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.3535

zbMATH Keywords

convex optimizationdualityindicator functionbest approximationimage recoveryprojectorelastic netproximity operatorlower-semicontinuous convex functionproximal splitting algorithm

Mathematics Subject Classification ID

Linear operator approximation theory (47A58) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Mathematical programming (90C99) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)

Related Items (20)

A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms ⋮ Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm ⋮ A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem ⋮ A proximal interior point algorithm with applications to image processing ⋮ Dual block-coordinate forward-backward algorithm with application to deconvolution and deinterlacing of video sequences ⋮ A splitting algorithm for dual monotone inclusions involving cocoercive operators ⋮ Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators ⋮ Alternating Proximal Regularized Dictionary Learning ⋮ Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function ⋮ Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting ⋮ On the existence of minimizers of proximity functions for split feasibility problems ⋮ A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation ⋮ Projective splitting methods for sums of maximal monotone operators with applications ⋮ Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization ⋮ Variable Metric Forward-Backward Algorithm for Composite Minimization Problems ⋮ Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions ⋮ Variable metric forward–backward splitting with applications to monotone inclusions in duality ⋮ Convergence of proximal gradient algorithm in the presence of adjoint mismatch ^* ⋮ Discrete Total Variation: New Definition and Minimization ⋮ A splitting algorithm for system of composite monotone inclusions

Uses Software

• UNLocBoX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Dualization of signal recovery problems
• Elastic-net regularization in learning theory
• A cyclic projection algorithm via duality
• Dykstra's alternating projection algorithm for two sets
• Nonsmooth mechanics and analysis. Theoretical and numerical advances
• Proximal Splitting Methods in Signal Processing
• A Dual Approach to Linear Inverse Problems with Convex Constraints
• Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Regularization and Variable Selection Via the Elastic Net
• Signal Recovery by Proximal Forward-Backward Splitting
• Proximité et dualité dans un espace hilbertien
• Convex analysis and monotone operator theory in Hilbert spaces
• Best approximation in inner product spaces

This page was built for publication: Proximity for sums of composite functions