Online bandit convex optimisation with stochastic constraints via two-point feedback

DOI10.1080/00207721.2023.2209566zbMath1522.90110MaRDI QIDQ6115925

Unnamed Author, Guo Chen, Jueyou Li

Publication date: 10 August 2023

Published in: International Journal of Systems Science (Search for Journal in Brave)

zbMATH Keywords

stochastic constraintsregret analysisonline optimisationbandit convex optimisation

Mathematics Subject Classification ID

Convex programming (90C25) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Distributed bandit online optimisation for energy management in smart grids

Cites Work

• Unnamed Item
• Unnamed Item
• Logarithmic regret algorithms for online convex optimization
• Online Learning and Online Convex Optimization
• An Online Convex Optimization Approach to Proactive Network Resource Allocation
• An Incentive-Based Online Optimization Framework for Distribution Grids
• Constrained Online Convex Optimization With Feedback Delays
• Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints
• Online Convex Optimization With Time-Varying Constraints and Bandit Feedback

This page was built for publication: Online bandit convex optimisation with stochastic constraints via two-point feedback