Pages that link to "Item:Q4567122"
From MaRDI portal
The following pages link to Distributed Online Optimization in Dynamic Environments Using Mirror Descent (Q4567122):
Displaying 34 items.
- A privacy-masking learning algorithm for online distributed optimization over time-varying unbalanced digraphs (Q2051672) (← links)
- On stochastic mirror descent with interacting particles: convergence properties and variance reduction (Q2077867) (← links)
- Distributed online bandit optimization under random quantization (Q2097746) (← links)
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources (Q2174029) (← links)
- Personalized optimization with user's feedback (Q2665405) (← links)
- Event-triggered distributed online convex optimization with delayed bandit feedback (Q2698149) (← links)
- (Q4998943) (← links)
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions (Q5211352) (← links)
- Analysis of Online Composite Mirror Descent Algorithm (Q5380674) (← links)
- Adaptive online distributed optimization in dynamic environments (Q5865329) (← links)
- Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique (Q6053929) (← links)
- Online distributed detection of sensor networks with delayed information (Q6061066) (← links)
- Dynamic online convex optimization with long-term constraints via virtual queue (Q6066161) (← links)
- Differentially private distributed online learning over time‐varying digraphs via dual averaging (Q6085173) (← links)
- Distributed continuous‐time constrained convex optimization with general time‐varying cost functions (Q6089867) (← 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)
- Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks (Q6180222) (← links)
- Distributed dynamic online learning with differential privacy via path-length measurement (Q6496161) (← links)
- Distributed online optimisation in unknown dynamic environment (Q6544836) (← links)
- Distributed inertial online game algorithm for tracking generalized Nash equilibria (Q6552805) (← links)
- Online composite optimization with time-varying regularizers (Q6559338) (← links)
- Online convex optimization using coordinate descent algorithms (Q6566762) (← links)
- Distributed adaptive online learning for convex optimization with weight decay (Q6578717) (← links)
- An accelerated distributed online gradient push-sum algorithm on time-varying directed networks (Q6579045) (← links)
- Distributed second-order multi-agent constrained optimization algorithm with time-varying cost function (Q6580833) (← links)
- Gradient-free algorithms for distributed online convex optimization (Q6581072) (← links)
- Privacy-preserving distributed projected one-point bandit online optimization over directed graphs (Q6583485) (← links)
- Stochastic mirror descent for convex optimization with consensus constraints (Q6598411) (← links)
- Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach (Q6611353) (← 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)
- Distributed online constrained convex optimization with event-triggered communication (Q6652185) (← links)