Pages that link to "Item:Q1999014"
From MaRDI portal
The following pages link to Parallel alternating direction method of multipliers (Q1999014):
Displaying 12 items.
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers (Q122993) (← links)
- Parallel alternating direction multiplier decomposition of convex programs (Q1321443) (← links)
- Is ADMM always faster than average consensus? (Q1641079) (← links)
- Parallel multi-block ADMM with \(o(1/k)\) convergence (Q1704845) (← links)
- A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment (Q1787329) (← links)
- Parallel implicit methods of alternating directions (Q1975092) (← links)
- Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm (Q2138301) (← links)
- Hybrid MPI/OpenMP parallel asynchronous distributed alternating direction method of multipliers (Q2244063) (← links)
- An augmented Lagrangian based algorithm for distributed nonconvex optimization (Q2805706) (← links)
- Distributed inexact dual consensus ADMM for network resource allocation (Q5131033) (← links)
- Distributed cooperative optimization for multiple heterogeneous Euler-Lagrangian systems under global equality and inequality constraints (Q6087516) (← links)
- Synchronous distributed ADMM for consensus convex optimization problems with self-loops (Q6205036) (← links)
