Pages that link to "Item:Q2205974"
From MaRDI portal
The following pages link to Asynchronous parallel algorithms for nonconvex optimization (Q2205974):
Displaying 22 items.
- Parallel asynchronous iterations of least fixed points (Q688197) (← links)
- A parallel asynchronous Newton algorithm for unconstrained optimization (Q1321336) (← links)
- Parallel synchronous and asynchronous space-decomposition algorithms for large-scale minimization problems (Q1588843) (← links)
- Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768) (← links)
- A distributed asynchronous method of multipliers for constrained nonconvex optimization (Q1737831) (← links)
- Asynchronous iterative algorithms for nonexpansive linear systems (Q1970220) (← links)
- A framework for parallel and distributed training of neural networks (Q2181060) (← links)
- Asynchronous level bundle methods (Q2205980) (← links)
- An inertial parallel and asynchronous forward-backward iteration for distributed convex optimization (Q2322371) (← links)
- 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)
- On the parallelization upper bound for asynchronous stochastic gradients descent in non-convex optimization (Q2696976) (← links)
- (Q3813170) (← links)
- Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters (Q4558160) (← links)
- Asynchronous Distributed ADMM for Large-Scale Optimization—Part II: Linear Convergence Analysis and Numerical Performance (Q4619616) (← links)
- Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting (Q4624929) (← links)
- Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes (Q5038180) (← 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)
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm (Q5502117) (← 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)