Pages that link to "Item:Q4012438"
From MaRDI portal
The following pages link to On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm (Q4012438):
Displaying 16 items.
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- Computational study of the nonhierarchical decomposition algorithm (Q1315449) (← links)
- A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- On asynchronous iterations (Q1591182) (← links)
- On unbounded delays in asynchronous parallel fixed-point algorithms (Q1668724) (← links)
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768) (← links)
- Asynchronous parallel algorithms for nonconvex optimization (Q2205974) (← links)
- Incrementally updated gradient methods for constrained and regularized optimization (Q2251572) (← links)
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates (Q2821779) (← links)
- On the rate of convergence of projected Barzilai–Borwein methods (Q3458822) (← links)
- Globally convergent block-coordinate techniques for unconstrained optimization (Q4254662) (← links)
- Convergence rate analysis of an asynchronous space decomposition method for convex Minimization (Q4529709) (← links)
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays (Q5058405) (← links)
- On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games (Q5108262) (← links)
