Proximity for sums of composite functions
From MaRDI portal
Publication:536271
convex optimizationelastic netbest approximationdualityindicator functionprojectorimage recoveryproximity operatorlower-semicontinuous convex functionproximal splitting algorithm
Linear operator approximation theory (47A58) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30) Mathematical programming (90C99)
Abstract: We propose an algorithm for computing the proximity operator of a sum of composite convex functions in Hilbert spaces and investigate its asymptotic behavior. Applications to best approximation and image recovery are described.
Recommendations
- Proximal splitting methods in signal processing
- scientific article; zbMATH DE number 5077050
- Signal Recovery by Proximal Forward-Backward Splitting
- Reconstruction of functions from prescribed proximal points
- Best interpolation with convex constraints
- The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
- scientific article; zbMATH DE number 1130743
- Approximate proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces
- Constructive approximation of solutions to proximal split feasibility problems
- The natural best \(L^ 1\)-approximation by nondecreasing functions
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 5564093 (Why is no real title available?)
- scientific article; zbMATH DE number 3973706 (Why is no real title available?)
- scientific article; zbMATH DE number 3694690 (Why is no real title available?)
- scientific article; zbMATH DE number 3192366 (Why is no real title available?)
- A Dual Approach to Linear Inverse Problems with Convex Constraints
- A cyclic projection algorithm via duality
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Best approximation in inner product spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- Dualization of signal recovery problems
- Dykstra's alternating projection algorithm for two sets
- Elastic-net regularization in learning theory
- Iterative construction of the resolvent of a sum of maximal monotone operators
- Nonlinear total variation based noise removal algorithms
- Nonsmooth mechanics and analysis. Theoretical and numerical advances
- Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
- Proximal splitting methods in signal processing
- Proximité et dualité dans un espace hilbertien
- Regularization and Variable Selection Via the Elastic Net
- Signal Recovery by Proximal Forward-Backward Splitting
Cited in
(29)- Proximity operators of perspective functions with nonlinear scaling
- Enhanced computation of the proximity operator for perspective functions
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- On the existence of minimizers of proximity functions for split feasibility problems
- Proximal operator of quotient functions with application to a feasibility problem in query optimization
- Projective splitting methods for sums of maximal monotone operators with applications
- A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation
- Convergence of proximal gradient algorithm in the presence of adjoint mismatch
- Discrete total variation: new definition and minimization
- Parseval proximal neural networks
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm
- Proximal splitting methods in signal processing
- Alternating proximal regularized dictionary learning
- On a decomposition formula for the proximal operator of the sum of two convex functions
- Variable metric forward-backward splitting with applications to monotone inclusions in duality
- The geometry of monotone operator splitting methods
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A splitting algorithm for system of composite monotone inclusions
- A penalized nonlinear ADMM algorithm applied to the multi-constrained traffic assignment problem
- Distributed deterministic asynchronous algorithms in time-varying graphs through Dykstra splitting
- Computing the resolvent of the sum of operators with application to best approximation problems
- 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
- Scalable Bayesian uncertainty quantification in imaging inverse problems via convex optimization
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
This page was built for publication: Proximity for sums of composite functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536271)
