Sökning: onr:"swepub:oai:DiVA.org:liu-55992" >
A Decomposition App...
A Decomposition Approach for Solving KYP-SDPs
-
- Wallin, Ragnar (författare)
- Linköpings universitet,Reglerteknik,Tekniska högskolan
-
- Hansson, Anders (författare)
- Linköpings universitet,Reglerteknik,Tekniska högskolan
-
- Gillberg, Jonas (författare)
- Linköpings universitet,Reglerteknik,Tekniska högskolan
-
(creator_code:org_t)
- Linköping : Linköping University Electronic Press, 2004
- Engelska 15 s.
-
Serie: LiTH-ISY-R, 1400-3902 ; 2621
- Relaterad länk:
-
https://liu.diva-por... (primary) (Raw object)
-
visa fler...
-
https://urn.kb.se/re...
-
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
- Semidenite programming
- Kalman-Yakubovich-Popov lemma
- Benders decomposition
- Automatic control
- Reglerteknik
Publikations- och innehållstyp
- vet (ämneskategori)
- rap (ämneskategori)