Pages that link to "Item:Q301677"
From MaRDI portal
The following pages link to A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677):
Displaying 14 items.
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- Proximal primal-dual best approximation algorithm with memory (Q1756584) (← links)
- Distributed convex optimization with coupling constraints over time-varying directed graphs (Q1983757) (← links)
- A dual Bregman proximal gradient method for relatively-strongly convex optimization (Q2092292) (← links)
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs (Q2181641) (← links)
- Sparsity-promoting distributed charging control for plug-in electric vehicles over distribution networks (Q2295316) (← links)
- A fully distributed ADMM-based dispatch approach for virtual power plant problems (Q2295330) (← links)
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs (Q2318770) (← links)
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs (Q2392808) (← links)
- Incremental gradient-free method for nonsmooth distributed optimization (Q2411165) (← links)
- Inexact alternating direction methods of multipliers for separable convex optimization (Q2419545) (← links)
- A fast dual gradient method for separable convex optimization via smoothing (Q2813610) (← links)
- Double smoothing technique for large-scale linearly constrained convex optimization (Q2910891) (← links)
- (Q4945767) (← links)
