Optimal solution approximation for infinite positive-definite quadratic programming (Q1897449): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02192225 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035084957 / rank | |||
Normal rank | |||
Latest revision as of 10:44, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal solution approximation for infinite positive-definite quadratic programming |
scientific article |
Statements
Optimal solution approximation for infinite positive-definite quadratic programming (English)
0 references
27 August 1995
0 references
We consider a general doubly-infinite, positive-definite, quadratic programming problem. We show that the sequence of unique optimal solutions to the natural finite-dimensional subproblems strongly converges to the unique optimal solution. This offers the opportunity to arbitrarily well approximate the infinite-dimensional optimal solution by numerically solving a sufficiently large finite-dimensional version of the problem. We then apply our results to a general time-varying, infinite-horizon, positive-definite, LQ control problem.
0 references
time-varying systems
0 references
positive-definite costs
0 references
infinite-horizon optimization
0 references
solution approximations
0 references
positive-definite quadratic programming
0 references
optimal solution
0 references
LQ control problem
0 references
