Pages that link to "Item:Q5174338"
From MaRDI portal
The following pages link to DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS (Q5174338):
Displaying 9 items.
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- Stochastic mirror descent method for distributed multi-agent optimization (Q1670526) (← links)
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks (Q1694193) (← links)
- Incremental gradient-free method for nonsmooth distributed optimization (Q2411165) (← links)
- Distributed Algorithm for Solving Convex Inequalities (Q4682321) (← links)
- Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints (Q4990169) (← links)
- Distributed Design for Nuclear Norm Minimization of Linear Matrix Equations With Constraints (Q5854053) (← links)
- A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints (Q6157447) (← links)
