Sökning: id:"swepub:oai:DiVA.org:liu-55924" >
Efficiently Solving...
Efficiently Solving Semidefinite Programs Originating from the KYP Lemma using Standard Primal-Dual Solvers
-
- Wallin, Ragnar (författare)
- Linköpings universitet,Reglerteknik,Tekniska högskolan
-
- Hansson, Anders (författare)
- Linköpings universitet,Reglerteknik,Tekniska högskolan
-
- Vandenberghe, Lieven (författare)
- University of California, CA, USA
-
(creator_code:org_t)
- Linköping : Linköping University Electronic Press, 2003
- Engelska 8 s.
-
Serie: LiTH-ISY-R, 1400-3902 ; 2503
- 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 (SDPs) originating from the Kalman-Yakubovich-Popov lemma often have a large number of variables. Standard solvers for semidefinite programs cannot handle problems of this size. Much research has been invested in developing customized solvers for such problems. In this paper we show that it is possible to use standard primal-dual SDP solvers if we reduce the number of variables in the dual SDP. The interesting variables in the primal SDP can be recovered from the solution.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)
Nyckelord
- Robustness analysis
- Automatic control
- Reglerteknik
Publikations- och innehållstyp
- vet (ämneskategori)
- rap (ämneskategori)