Generalization of the Kalman equation to a linear-quadratic optimal control problem

In a Hilbert space, a linear-quadratic optimal control problem with a fixed left end and a movable right end is considered. At the right end of the time interval, a linear programming problem is formulated, the solution of which implicitly determines the terminal condition. A saddle point approach is proposed, which is reduced to calculating the saddle point of the Lagrange function. It is based on saddle point inequalities for both groups of variables: direct and dual. These inequalities are sufficient conditions for optimality. A control synthesis is constructed that implements feedback in the presence of constraints on controls as a convex closed set. This is a new result, since in the classical case in the theory of a linear controller (Kalman equation) a similar result is proven only in the absence of constraints on controls.

Authors

Institutions

Publication Details

Journal
Informatics and Control Problems
Published
2025-12-26
DOI
https://doi.org/10.54381/icp.2025.2.02
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generalization of the Kalman equation to a linear-quadratic optimal control problem

Е.В. Хорошилова, А. С. Антипин
Informatics and Control Problems
Optimization and Variational Analysis
article

Generalization of the Kalman equation to a linear-quadratic optimal control problem

Е.В. Хорошилова, А. С. Антипин
article en

Abstract

In a Hilbert space, a linear-quadratic optimal control problem with a fixed left end and a movable right end is considered. At the right end of the time interval, a linear programming problem is formulated, the solution of which implicitly determines the terminal condition. A saddle point approach is proposed, which is reduced to calculating the saddle point of the Lagrange function. It is based on saddle point inequalities for both groups of variables: direct and dual. These inequalities are sufficient conditions for optimality. A control synthesis is constructed that implements feedback in the presence of constraints on controls as a convex closed set. This is a new result, since in the classical case in the theory of a linear controller (Kalman equation) a similar result is proven only in the absence of constraints on controls.

Informatics and Control ProblemsVol. 45(2(6))
Russian Academy of Sciences (RU), Lomonosov Moscow State University (RU), Moscow State University (TJ)
Openalex Percentile: Top 26%
Optimization and Variational Analysis
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.

Generalization of the Kalman equation to a linear-quadratic optimal control problem — Е.В. Хорошилова, А. С. Антипин · Informatics and Control Problems (2025) | TGRS Research Map | TGRS