Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
From MaRDI portal
Abstract: In this paper, we consider convex feasibility problems where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal splitting methods to convex minimization reformulations of convex feasibility problems. We also put forth distributed convergence tests which enable us to establish feasibility or infeasibility of the problem distributedly, and we provide convergence rate results. Under the assumption that the problem is feasible and boundedly linearly regular, these convergence results are given in terms of the distance of the iterates to the feasible set, which are similar to those of classical projection methods. In case the feasibility problem is infeasible, we provide convergence rate results that concern the convergence of certain error-bounds.
Recommendations
- Decentralized proximal splitting algorithms for composite constrained convex optimization
- Distributed algorithms for convex problems with linear coupling constraints
- Non-Convex feasibility problems and proximal point methods
- On solving proximal split feasibility problems and applications
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A multiprojection algorithm using Bregman projections in a product space
- A parallel subgradient projections method for the convex feasibility problem
- A proximal decomposition method for solving convex variational inverse problems
- Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Convex analysis and monotone operator theory in Hilbert spaces
- Cyclic subgradient projections
- Decomposition through formalization in a product space
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Dykstra's alternating projection algorithm for two sets
- Error bounds in mathematical programming
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Iterative methods of solving stochastic convex feasibility problems and applications
- Minimization of unsmooth functionals
- On Fixed Points of Non-Expansive Piecewise Isometric Mappings
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Proximal Decomposition Via Alternating Linearization
- Proximal splitting methods in signal processing
- Signal Recovery by Proximal Forward-Backward Splitting
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Templates for convex cone problems with applications to sparse signal recovery
- The method of projections for finding the common point of convex sets
Cited in
(1)
This page was built for publication: Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943811)
