Pages that link to "Item:Q5353240"
From MaRDI portal
The following pages link to An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization (Q5353240):
Displaying 12 items.
- Distributed robust adaptive equilibrium computation for generalized convex games (Q901177) (← links)
- Distributed constraint optimization on networked multi-agent systems (Q1732839) (← links)
- A new algorithm for distributed control problem with shortest-distance constraints (Q1792710) (← links)
- A consensus algorithm based on collective neurodynamic system for distributed optimization with linear and bound constraints (Q2185684) (← links)
- Measurement-based efficient resource allocation with demand-side adjustments (Q2280775) (← links)
- Distributed nonconvex constrained optimization over time-varying digraphs (Q2425183) (← links)
- Distributed Linear Programming with Event-Triggered Communication (Q3178441) (← links)
- Second-Order Guarantees of Distributed Gradient Algorithms (Q5131964) (← links)
- A gradient‐free distributed optimization method for convex sum of nonconvex cost functions (Q6069332) (← links)
- Fixed-time consensus for multi-agent systems with objective optimization on directed detail-balanced networks (Q6155115) (← links)
- Distributed fixed-time optimization for multi-agent systems over a directed network (Q6166407) (← links)
- Fixed‐time distributed optimization for multi‐agent systems with external disturbances over directed networks (Q6182074) (← links)
