DocumentCode
433907
Title
Successive D.C. relaxation for parametrized LMI problems
Author
Ichihara, Hiroyuki ; Nobuyama, Eitaku
Author_Institution
Kyushu Inst. of Technol., Fukuoka, Japan
Volume
2
fYear
2004
fDate
20-23 July 2004
Firstpage
1151
Abstract
This paper presents a global optimization algorithm using difference of multiconvex relaxation successively for parametrized LMI problems. The problem is formulated as a minimax problem. On branch and bound, the relaxation is performed iteratively to have a feasible solution of the parametrized LMI problem. Numerical examples for stability analysis of parameter dependent varying are shown.
Keywords
computational complexity; control system synthesis; linear matrix inequalities; minimax techniques; relaxation theory; stability; branch and bound method; global optimization algorithm; linear matrix inequalities; minimax problem; multiconvex relaxation difference; parametrized LMI problems; stability analysis; Ear; Eigenvalues and eigenfunctions; Iterative algorithms; Linear matrix inequalities; Minimax techniques; Performance analysis; Stability analysis; Symmetric matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Control Conference, 2004. 5th Asian
Conference_Location
Melbourne, Victoria, Australia
Print_ISBN
0-7803-8873-9
Type
conf
Filename
1426803
Link To Document