A Distributed Boyle--Dykstra--Han Scheme
From MaRDI portal
Publication:5355203
DOI10.1137/15M1034830zbMath1370.90178OpenAlexW2746494930MaRDI QIDQ5355203
Vivek S. Borkar, Soham R. Phade
Publication date: 7 September 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1034830
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Numerical methods in optimal control (49M99)
Related Items
Distributed Stochastic Approximation with Local Projections, Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting, Nonlinear Gossip
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed stochastic subgradient projection algorithms for convex optimization
- A cyclic projection algorithm via duality
- On the convergence of Han's method for convex programming with quadratic objective
- A successive projection method
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Concerning nonnegative matrices and doubly stochastic matrices
- Nonlinear Gossip
- Decomposition through formalization in a product space
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Dynamical System Approach to Stochastic Approximations
- Constrained Consensus and Optimization in Multi-Agent Networks
