Pages that link to "Item:Q255080"
From MaRDI portal
The following pages link to An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080):
Displaying 6 items.
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks (Q1694193) (← 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)
- Convergence analysis of an inexact three-operator splitting algorithm (Q2333865) (← links)
- Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization (Q2696990) (← links)
