5 papers
Online Sketched Newton-Raphson
Jean-Luc Lupien, Yuen-Man Pun, Youssef Diouane +2
In online convex optimization (OCO), a decision-maker is confronted with an unknown environment and seeks to play an optimal sequence of decisions on a short time-scale using only…
Entropy-Based Dynamic Programming for Efficient Vehicle Parking
Jean-Luc Lupien, Abdullah Alhadlaq, Yuhan Tang +2
In urban environments, parking has proven to be a significant source of congestion and inefficiency. In this study, we propose a methodology that offers a systematic solution to mi…
Online Convex Optimization for On-Board Routing in High-Throughput Satellites
Olivier Bélanger, Jean-Luc Lupien, Olfa Ben Yahia +3
The rise in low Earth orbit (LEO) satellite Internet services has led to increasing demand, often exceeding available data rates and compromising the quality of service. While depl…
Ex Post Conditions for the Exactness of Optimal Power Flow Conic Relaxations
Jean-Luc Lupien, Antoine Lesage-Landry
Convex relaxations of the optimal power flow (OPF) problem provide an efficient alternative to solving the intractable alternating current (AC) optimal power flow. The conic subset…
Online Interior-point Methods for Time-varying Equality-constrained Optimization
Jean-Luc Lupien, Iman Shames, Antoine Lesage-Landry
An important challenge in the online convex optimization (OCO) setting is to incorporate generalized inequalities and time-varying constraints. The inclusion of constraints in OCO…