Predictive online convex optimization

DOI10.1016/j.automatica.2019.108771zbMath1440.93013arXiv1905.06263OpenAlexW2996906268MaRDI QIDQ2173950

Antoine Lesage-Landry, Joshua A. Taylor, Iman Shames

Publication date: 17 April 2020

Published in: Automatica (Search for Journal in Brave)

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

zbMATH Keywords

learning algorithmsconvex optimizationpower systemsmachine learningrenewable energy systemsload dispatching

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale systems (93A15) Controllability, observability, and system structure (93B99)

Related Items (2)

Dynamic online convex optimization with long-term constraints via virtual queue ⋮ No-regret learning for repeated non-cooperative games with lossy bandits

Uses Software

• ECOS
• CVXPY

Cites Work

• Unnamed Item
• Logarithmic regret algorithms for online convex optimization
• Model predictive control: Theory and practice - a survey
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Predictive Control for Linear and Hybrid Systems
• Online Learning and Online Convex Optimization
• Numerical Optimization
• An Online Convex Optimization Approach to Proactive Network Resource Allocation
• Online Learning with Prior Knowledge

This page was built for publication: Predictive online convex optimization