Successive D.C. relaxation for parametrized LMI problems

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.