Pages that link to "Item:Q1689375"
From MaRDI portal
The following pages link to On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems (Q1689375):
Displaying 24 items.
- Primal recovery from consensus-based dual decomposition for distributed convex optimization (Q255083) (← links)
- Computational complexity certification for dual gradient method: application to embedded MPC (Q894005) (← links)
- Metric selection in fast dual forward-backward splitting (Q901087) (← links)
- Dual gradient method for linearly constrained, strongly convex, separable mathematical programming problems (Q1078076) (← links)
- Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation (Q1626886) (← links)
- Distributed model predictive control -- recursive feasibility under inexact dual optimization (Q1737767) (← links)
- Proximal ADMM for nonconvex and nonsmooth optimization (Q2097703) (← links)
- Decentralized convex optimization under affine constraints for power systems control (Q2104293) (← links)
- Tracking-ADMM for distributed constraint-coupled optimization (Q2184513) (← links)
- Linear convergence of primal-dual gradient methods and their performance in distributed optimization (Q2184550) (← links)
- Exponential convergence of distributed primal-dual convex optimization algorithm without strong convexity (Q2280701) (← links)
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs (Q2318770) (← links)
- Recursive least squares and multi-innovation stochastic gradient parameter estimation methods for signal modeling (Q2400928) (← links)
- Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs (Q2665379) (← links)
- Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC (Q2798546) (← links)
- Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization (Q4286937) (← links)
- On the convergence of exact distributed generalisation and acceleration algorithm for convex optimisation (Q5026632) (← links)
- A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) (← links)
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)
- Linear Convergence of ADMM Under Metric Subregularity for Distributed Optimization (Q6053300) (← links)
- Decentralized Strongly-Convex Optimization with Affine Constraints: Primal and Dual Approaches (Q6069998) (← links)
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks (Q6085458) (← links)
- Distributed dual subgradient methods with averaging and applications to grid optimization (Q6644268) (← links)
