Online Convex Optimization With Binary Constraints

DOI10.1109/TAC.2021.3061625MaRDI QIDQ5033925zbMATH OpenFDO

Authors Antoine Lesage-Landry, Duncan S. Callaway, Joshua A. Taylor

Publication date 24 February 2022

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.02274

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Recommendations

• Online constrained optimization with recourse
• Introduction to Online Convex Optimization
• Online learning and online convex optimization
• An online convex optimization-based framework for convex bilevel optimization
• Online Convex Optimization With Time-Varying Constraints and Bandit Feedback
• Constrained Online Convex Optimization With Feedback Delays
• Fast algorithms for online stochastic convex programming
• Mirror descent and constrained online optimization problems
• Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
• Predictive online convex optimization

Cited in

(10)

• Online BP functions maximization
• Exploiting problem structure in optimization under uncertainty via online convex optimization
• An online convex optimization-based framework for convex bilevel optimization
• Constrained Online Convex Optimization With Feedback Delays
• Second-Order Online Nonconvex Optimization
• Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
• Introduction to Online Convex Optimization
• Online Convex Optimization with Binary Constraints
• Online dynamic submodular optimization
• Convergence analysis of an online approach to parameter estimation problems based on binary observations

This page was built for publication: Online Convex Optimization With Binary Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033925)