Pages that link to "Item:Q5211352"
From MaRDI portal
The following pages link to Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions (Q5211352):
Displaying 9 items.
- Continuous-time distributed optimization with strictly pseudoconvex objective functions (Q2071212) (← links)
- Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization (Q6056047) (← links)
- A gradient‐free distributed optimization method for convex sum of nonconvex cost functions (Q6069332) (← links)
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints (Q6136151) (← links)
- Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm (Q6136497) (← links)
- Gradient-free algorithms for distributed online convex optimization (Q6581072) (← links)
- Random gradient-free method for online distributed optimization with strongly pseudoconvex cost functions (Q6630989) (← links)
- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets (Q6632505) (← links)
- Online distributed optimization with stochastic gradients: high probability bound of regrets (Q6636942) (← links)