Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization
From MaRDI portal
Publication:2977631
DOI10.1080/02331934.2016.1252914zbMath1393.90077arXiv1510.07107OpenAlexW2963047419MaRDI QIDQ2977631
Publication date: 18 April 2017
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.07107
almost sure convergencesubgradientmetric projectionproximity operatordistributed nonsmooth convex optimizationrandom projection algorithm
Related Items (2)
Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization ⋮ Fixed point quasiconvex subgradient method
Cites Work
- Unnamed Item
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Generalized network design problems. Modeling and optimization.
- Random algorithms for convex minimization problems
- Convex analysis and nonlinear optimization. Theory and examples.
- Time-varying network optimization.
- Fast linear iterations for distributed averaging
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Stochastic First-Order Methods with Random Constraint Projection
- A new class of distributed optimization algorithms: application to regression of distributed data
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
- Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization
- On optimal management of resources in distributed networks
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
- Parallel bucket sorting on graphics processing units based on convex optimization
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Combinatorial Matrix Theory
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization
