Semidefinite Programming Duality in Infinite-Horizon Linear Quadratic Differential Games

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Watanabe, Yuto, Pai, Chih-Fan, Zheng, Yang
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866917975614816256
author Watanabe, Yuto
Pai, Chih-Fan
Zheng, Yang
author_facet Watanabe, Yuto
Pai, Chih-Fan
Zheng, Yang
contents Semidefinite programs (SDPs) play a crucial role in control theory, traditionally as a computational tool. Beyond computation, the duality theory in convex optimization also provides valuable analytical insights and new proofs of classical results in control. In this work, we extend this analytical use of SDPs to study the infinite-horizon linear-quadratic (LQ) differential game in continuous time. Under standard assumptions, we introduce a new SDP-based primal-dual approach to establish the saddle point characterized by linear static policies in LQ games. For this, we leverage the Gramian representation technique, which elegantly transforms linear quadratic control problems into tractable convex programs. We also extend this duality-based proof to the $\mathcal{H}_\infty$ suboptimal control problem. To our knowledge, this work provides the first primal-dual analysis using Gramian representations for the LQ game and $\mathcal{H}_\infty$ control beyond LQ optimal control and $\mathcal{H}_\infty$ analysis.
format Preprint
id arxiv_https___arxiv_org_abs_2504_02201
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Semidefinite Programming Duality in Infinite-Horizon Linear Quadratic Differential Games
Watanabe, Yuto
Pai, Chih-Fan
Zheng, Yang
Optimization and Control
Semidefinite programs (SDPs) play a crucial role in control theory, traditionally as a computational tool. Beyond computation, the duality theory in convex optimization also provides valuable analytical insights and new proofs of classical results in control. In this work, we extend this analytical use of SDPs to study the infinite-horizon linear-quadratic (LQ) differential game in continuous time. Under standard assumptions, we introduce a new SDP-based primal-dual approach to establish the saddle point characterized by linear static policies in LQ games. For this, we leverage the Gramian representation technique, which elegantly transforms linear quadratic control problems into tractable convex programs. We also extend this duality-based proof to the $\mathcal{H}_\infty$ suboptimal control problem. To our knowledge, this work provides the first primal-dual analysis using Gramian representations for the LQ game and $\mathcal{H}_\infty$ control beyond LQ optimal control and $\mathcal{H}_\infty$ analysis.
title Semidefinite Programming Duality in Infinite-Horizon Linear Quadratic Differential Games
topic Optimization and Control
url https://arxiv.org/abs/2504.02201