Online Optimization With Unknown Time-Varying Parameters

In this letter we study optimization problems where the cost function contains time-varying parameters that are unmeasurable and evolve according to linear, yet unknown, dynamics. We propose a solution that leverages control theoretic tools to identify the dynamics of the parameters, predict their evolution, and ultimately compute a solution to the optimization problem. The identification of the dynamics of the time-varying parameters is done online using measurements of the gradient of the cost function. This system identification problem is not standard, since the output matrix is known and the dynamics of the parameters must be estimated in the original coordinates without similarity transformations. Interestingly, our analysis shows that, under mild conditions that we characterize, the identification of the parameter dynamics and, consequently, the computation of a time-varying solution to the optimization problem, requires only a finite number of measurements of the gradient of the cost function. We illustrate the effectiveness of our algorithm on a series of numerical examples.

Authors

Institutions

Publication Details

Journal
IEEE Control Systems Letters
Published
2025-01-01
DOI
https://doi.org/10.1109/lcsys.2025.3582207
Primary Topic
Optimization and Search Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Online Optimization With Unknown Time-Varying Parameters

Abed AlRahman Al Makdah, Fabio Pasqualetti, Shivanshu Tripathi
IEEE Control Systems Letters
Optimization and Search Problems
article

Online Optimization With Unknown Time-Varying Parameters

Abed AlRahman Al Makdah, Fabio Pasqualetti, Shivanshu Tripathi
article en

Abstract

In this letter we study optimization problems where the cost function contains time-varying parameters that are unmeasurable and evolve according to linear, yet unknown, dynamics. We propose a solution that leverages control theoretic tools to identify the dynamics of the parameters, predict their evolution, and ultimately compute a solution to the optimization problem. The identification of the dynamics of the time-varying parameters is done online using measurements of the gradient of the cost function. This system identification problem is not standard, since the output matrix is known and the dynamics of the parameters must be estimated in the original coordinates without similarity transformations. Interestingly, our analysis shows that, under mild conditions that we characterize, the identification of the parameter dynamics and, consequently, the computation of a time-varying solution to the optimization problem, requires only a finite number of measurements of the gradient of the cost function. We illustrate the effectiveness of our algorithm on a series of numerical examples.

IEEE Control Systems LettersVol. 9
University of California, Riverside (US), Arizona State University (US)
Openalex Percentile: Top 85%
Optimization and Search Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.