Successive D.C. relaxation for parametrized LMI problems

Hiroyuki Ichihara, Eitaku Nobuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish
Title of host publication2004 5th Asian Control Conference
Number of pages5
Publication statusPublished - 1 Dec 2004
Event2004 5th Asian Control Conference - Melbourne, Australia
Duration: 20 Jul 200423 Jul 2004

Publication series

Name2004 5th Asian Control Conference


Conference2004 5th Asian Control Conference

Fingerprint Dive into the research topics of 'Successive D.C. relaxation for parametrized LMI problems'. Together they form a unique fingerprint.

  • Cite this

    Ichihara, H., & Nobuyama, E. (2004). Successive D.C. relaxation for parametrized LMI problems. In 2004 5th Asian Control Conference (pp. 1151-1155). (2004 5th Asian Control Conference; Vol. 2).