Dynamic online convex optimization with long-term constraints via virtual queue
From MaRDI portal
Publication:6066161
DOI10.1016/j.ins.2021.06.072zbMath1529.68327OpenAlexW3175253260MaRDI QIDQ6066161
No author found.
Publication date: 12 December 2023
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2021.06.072
resource allocationcloud computingvirtual queuesdynamic regretconstrained online convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GGA: a modified genetic algorithm with gradient-based local search for solving constrained optimization problems
- Predictive online convex optimization
- Optimization of vehicle speed for batches to minimize supply chain cost under uncertain demand
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Stochastic Network Optimization with Application to Communication and Queueing Systems
- Online Distributed Convex Optimization on Dynamic Networks
- Online Learning and Online Convex Optimization
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- A Saddle Point Algorithm for Networked Online Convex Optimization
- An Online Convex Optimization Approach to Proactive Network Resource Allocation
- A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Online Convex Optimization With Time-Varying Constraints and Bandit Feedback
- Online Learning with Constraints
- Online Learning of Feasible Strategies in Unknown Environments
This page was built for publication: Dynamic online convex optimization with long-term constraints via virtual queue
