Pages that link to "Item:Q2768028"
From MaRDI portal
The following pages link to Distributed asynchronous incremental subgradient methods (Q2768028):
Displaying 33 items.
- On stochastic gradient and subgradient methods with adaptive steplength sequences (Q445032) (← links)
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions (Q507334) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Incremental proximal methods for large scale convex optimization (Q644913) (← links)
- Near-optimal stochastic approximation for online principal component estimation (Q681490) (← links)
- Projected equation methods for approximate solution of large linear systems (Q1012492) (← links)
- An incremental subgradient method on Riemannian manifolds (Q1752648) (← links)
- Asynchronous gradient algorithms for a class of convex separable network flow problems (Q1915768) (← links)
- The effect of deterministic noise in subgradient methods (Q1960191) (← links)
- Asynchronous parallel algorithms for nonconvex optimization (Q2205974) (← links)
- Asynchronous level bundle methods (Q2205980) (← links)
- Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
- Communication-efficient algorithms for decentralized and stochastic optimization (Q2297648) (← links)
- An inertial parallel and asynchronous forward-backward iteration for distributed convex optimization (Q2322371) (← links)
- The incremental subgradient methods on distributed estimations in-network (Q2335919) (← links)
- Parallel subgradient methods for convex optimization. (Q2768025) (← links)
- Stochastic first-order methods with random constraint projection (Q2796796) (← links)
- ARock: an algorithmic framework for asynchronous parallel coordinate updates (Q2821779) (← links)
- Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters (Q4558160) (← links)
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (Q4602346) (← links)
- An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming (Q4620422) (← links)
- A Distributed, Asynchronous, and Incremental Algorithm for Nonconvex Optimization: An ADMM Approach (Q4630116) (← links)
- Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods (Q4641660) (← links)
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays (Q5058405) (← links)
- A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints (Q5152474) (← links)
- Projection algorithms with dynamic stepsize for constrained composite minimization (Q5225430) (← links)
- Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms (Q5245368) (← links)
- Distributed Saddle-Point Subgradient Algorithms With Laplacian Averaging (Q5352624) (← links)
- Asynchronous Gradient Push (Q5853993) (← links)
- Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems (Q5863523) (← links)
- An asynchronous subgradient-proximal method for solving additive convex optimization problems (Q6093360) (← links)
- Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization (Q6166657) (← links)
- Non-ergodic linear convergence property of the delayed gradient descent under the strongly convexity and the Polyak-Łojasiewicz condition (Q6587593) (← links)
