Parallel subgradient methods for convex optimization.
From MaRDI portal
Recommendations
- Parallel subgradient method for nonsmooth convex optimization with a simple constraint
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- Distributed asynchronous incremental subgradient methods
- A parallel bundle framework for asynchronous subspace optimization of nonsmooth convex functions
Cited in
(13)- An incremental subgradient method on Riemannian manifolds
- A parallel line search subspace correction method for composite convex optimization
- A parallel bundle framework for asynchronous subspace optimization of nonsmooth convex functions
- scientific article; zbMATH DE number 1046042 (Why is no real title available?)
- A class of parallel multiple-front algorithms on subdomains
- scientific article; zbMATH DE number 1552030 (Why is no real title available?)
- Parallel algorithms and probability of large deviation for stochastic convex optimization problems
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- scientific article; zbMATH DE number 1424206 (Why is no real title available?)
- Projection algorithms with dynamic stepsize for constrained composite minimization
- An asynchronous subgradient-proximal method for solving additive convex optimization problems
This page was built for publication: Parallel subgradient methods for convex optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768025)
