Distributed solutions for loosely coupled feasibility problems using proximal splitting methods

DOI10.1080/10556788.2014.902056zbMath1327.90111arXiv1306.6807OpenAlexW1976953338MaRDI QIDQ2943811

No author found.

Publication date: 4 September 2015

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

distributed solutionproximal splittingfeasible/infeasible convex feasibility problemsflow feasibility problem

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Decomposition methods (49M27)

Related Items (1)

An optimization algorithm based on forward recursion with applications to variable horizon MPC

Cites Work

• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Fast alternating linearization methods for minimizing the sum of two convex functions
• Convergence results for an accelerated nonlinear Cimmino algorithm
• A parallel subgradient projections method for the convex feasibility problem
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Dykstra's alternating projection algorithm for two sets
• A multiprojection algorithm using Bregman projections in a product space
• Error bounds in mathematical programming
• Iterative methods of solving stochastic convex feasibility problems and applications
• Templates for convex cone problems with applications to sparse signal recovery
• Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
• Proximal Splitting Methods in Signal Processing
• A proximal decomposition method for solving convex variational inverse problems
• Decomposition through formalization in a product space
• On Fixed Points of Non-Expansive Piecewise Isometric Mappings
• Cyclic subgradient projections
• Convergence rate analysis and error bounds for projection algorithms in convex feasibility problems
• Proximal Decomposition Via Alternating Linearization
• On Projection Algorithms for Solving Convex Feasibility Problems
• Signal Recovery by Proximal Forward-Backward Splitting
• The method of projections for finding the common point of convex sets
• Minimization of unsmooth functionals
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Distributed solutions for loosely coupled feasibility problems using proximal splitting methods