6 papers
An Efficient Method to Verify the Inclusion of Ellipsoids
Julien Calbert, Lucas N. Egidio, Raphaël M. Jungers
We present a novel method for deciding whether a given n-dimensional ellipsoid contains another one (possibly with a different center). This method consists in constructing a parti…
Stabilization of rank-deficient continuous-time switched affine systems
Lucas N. Egidio, Grace S. Deaecto, Raphaël M. Jungers
This paper treats the global stabilization problem of continuous-time switched affine systems that have rank-deficient convex combinations of their dynamic matrices. For these syst…
Stability of Switched Affine Systems: Arbitrary and Dwell-Time Switching
Matteo Della Rossa, Lucas N. Egidio, Raphaël M. Jungers
The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct…
Data-driven stability analysis of switched affine systems
Matteo Della Rossa, Zheming Wang, Lucas N. Egidio +1
We consider discrete-time switching systems composed of a finite family of affine sub-dynamics. First, we recall existing results and present further analysis on the stability prob…
On the Search for Equilibrium Points of Switched Affine Systems
Lucas N. Egidio, Anders Hansson
One of the main aspects of switched affine systems that makes their stabilizability study intricate is the existence of (generally) infinitely many equilibrium points in the state…
Learning the Step-size Policy for the Limited-Memory Broyden-Fletcher-Goldfarb-Shanno Algorithm
Lucas N. Egidio, Anders Hansson, Bo Wahlberg
We consider the problem of how to learn a step-size policy for the Limited-Memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm. This is a limited computational memory quasi-…