Sökning: onr:"swepub:oai:DiVA.org:liu-36970" >
A Decomposition Approach for Solving KYP-SDPs
-
- Wallin, Ragnar, 1962- (författare)
- Linköpings universitet,Reglerteknik,Tekniska högskolan
-
- Kao, Chung-Yao (författare)
- University of Melbourne, Australia
-
- Hansson, Anders (författare)
- Linköpings universitet,Reglerteknik,Tekniska högskolan
-
(creator_code:org_t)
- 2005
- Engelska.
-
Ingår i: Proceedings of the 16th IFAC World Congress. - 9783902661753 ; , s. 1021-1021
- Relaterad länk:
-
http://urn.kb.se/res...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.3...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)
Nyckelord
- Optimization
- Decomposition methods
- Robust control
- TECHNOLOGY
- TEKNIKVETENSKAP
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)