A Cutting Plane Method for Solving KYP-SDPs

• Semidefinite programs originating from the Kalman-Yakubovich-Popov lemma are convex optimization problems and there exist polynomial time algorithms that solve them. However, the number of variables is often very large making the computational time extremely long. Algorithms more efficient than general purpose solvers are thus needed. To this end structure exploiting algorithms have been proposed, based on the dual formulation. In this paper a cutting plane algorithm is proposed. In a comparison with a general purpose solver and a structure exploiting solver it is shown that the cutting plane based solver can handle optimization problems of much higher dimension.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)

Keyword

Semidefinite programming

Kalman-Yakubovich-Popov lemma

Cutting plane method

Stability analysis

TECHNOLOGY

TEKNIKVETENSKAP

Automatic control

Reglerteknik

Publication and Content Type

ref (subject category)

art (subject category)