SearcharxivSearch

arXiv subjects

Paul Malisani

Publications and source records attributed to Paul Malisani.

4 recordsLinked to original sources

Robust Stochastic Optimal Control via variance penalization: Application to Energy Management Systems

This paper addresses a class of robust stochastic optimal control problems. Its main contribution lies in the introduction of a general optimization model with variance penalization and an associated solution algorithm that improves out-of-sample robustness while preserving numerical complexity. The proposed variance-penalized model is inspired by a well-established machine learning practice that aims to limit overfitting and extends this idea to stochastic optimal control. Using the Douglas--Rachford splitting method, the authors develop a Variance-Penalized Progressive Hedging Algorithm (VPPHA) that retains the computational complexity of the standard PHA while achieving superior out-of-sample performance. In addition, the authors propose a three-step control framework comprising (i) a random scenario generation method, (ii) a scenario reduction algorithm, and (iii) a scenario-based optimal control computation using the VPPHA. Finally, the proposed method is validated through simulations of a stationary battery Energy Management System (EMS) using ground-truth electricity consumption and production measurements from a predominantly commercial building in Solaize, France. The results demonstrate that the proposed approach outperforms a classical Model Predictive Control (MPC) strategy, which itself performs better than the standard PHA.

math.OC

Scenario Tree Reduction via Wasserstein Barycenters

Scenario tree reduction techniques are essential for achieving a balance between an accurate representation of uncertainties and computational complexity when solving multistage stochastic programming problems. In the realm of available techniques, the Kovacevic and Pichler algorithm (Ann. Oper. Res., 2015 [1]) stands out for employing the nested distance, a metric for comparing multistage scenario trees. However, dealing with large-scale scenario trees can lead to a prohibitive computational burden due to the algorithm's requirement of solving several large-scale linear problems per iteration. This study concentrates on efficient approaches to solving such linear problems, recognizing that their solutions are Wasserstein barycenters of the tree nodes' probabilities on a given stage. We leverage advanced optimal transport techniques to compute Wasserstein barycenters and significantly improve the computational performance of the Kovacevic and Pichler algorithm. Our boosted variants of this algorithm are benchmarked on several multistage scenario trees. Our experiments show that compared to the original scenario tree reduction algorithm, our variants can be eight times faster for reducing scenario trees with 8 stages, 78 125 scenarios, and 97 656 nodes.

math.OC

Interior Point Methods in Optimal Control

This paper deals with Interior Point Methods (IPMs) for Optimal Control Problems (OCPs) with pure state and mixed constraints. This paper establishes a complete proof of convergence of IPMs for a general class of OCPs. Convergence results are proved for primal variables, namely state and control variables, and for dual variables, namely, the adjoint state, and the constraints multipliers. In addition, the presented convergence result does not rely on a strong convexity assumption. Finally, this paper provides two IPM-based solving algorithms: a primal solving algorithm and a primal-dual solving algorithm.

math.OC

Interior point methods in optimal control problems of affine systems: Convergence results and solving algorithms

This paper presents an interior point method for pure-state and mixed-constrained optimal control problems for dynamics, mixed constraints, and cost function all affine in the control variable. This method relies on resolving a sequence of two-point boundary value problems of differential and algebraic equations. This paper establishes a convergence result for primal and dual variables of the optimal control problem. A primal and a primal-dual solving algorithm are presented, and a challenging numerical example is treated for illustration. Accepted for publication at SIAM SICON 2023

math.OC