Pages that link to "Item:Q2205974"
From MaRDI portal
The following pages link to Asynchronous parallel algorithms for nonconvex optimization (Q2205974):
Displaying 8 items.
- On the convergence of asynchronous parallel iteration with unbounded delays (Q2422607) (← links)
- The last dozen of years of or research in Czechia and Slovakia (Q2673270) (← links)
- Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters (Q4558160) (← links)
- Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting (Q4624929) (← links)
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays (Q5058405) (← links)
- An Optimal Algorithm for Decentralized Finite-Sum Optimization (Q5162661) (← links)
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks (Q6085458) (← links)
- Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization (Q6166657) (← links)