A Decomposition Approach for Solving KYP-SDPs
2005 (English)In: Proceedings of the 16th IFAC World Congress, 2005, 1021-1021 p.Conference paper (Refereed)
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. In this paper a generalized Benders decomposition algorithm is applied to the problem to improve efficiency.
Place, publisher, year, edition, pages
2005. 1021-1021 p.
Optimization, Decomposition methods, Robust control
Engineering and Technology Control Engineering
IdentifiersURN: urn:nbn:se:liu:diva-36970DOI: 10.3182/20050703-6-CZ-1902.01022Local ID: 33173ISBN: 978-3-902661-75-3OAI: oai:DiVA.org:liu-36970DiVA: diva2:257819
16th IFAC World Congress, Prague, Czech Republic, July, 2005