Reducing the computation required to solve a standard minimax problem (Q1911281): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0005-1098(95)00095-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2090440768 / rank | |||
Normal rank |
Revision as of 00:24, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Reducing the computation required to solve a standard minimax problem |
scientific article |
Statements
Reducing the computation required to solve a standard minimax problem (English)
0 references
5 June 1996
0 references
The author considers a minimax optimization problem involving time-dependent matrices. The inner level maximization problem is seen to have its extrema among a very large number of vertices of an uncertainty set. It is shown that this number can be significantly reduced. The outer-level minimization is convex and the problem is solved by using a sequential quadratic programming method. Then the author shows how his results can be used in considering the problem of synthesizing a robust state feedback control for a system with parameter uncertainty. Finally, an illustrative example is considered: a stabilizing state feedback compensator is found for a system depending on 15 uncertain parameters.
0 references
minimax optimization
0 references
time-dependent
0 references
robust state feedback
0 references
parameter uncertainty
0 references