Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A Decomposition Approach for Solving KYP-SDPs
Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska högskolan.
University of Melbourne, Australia.
Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska högskolan.
2005 (Engelska)Ingår i: Proceedings of the 16th IFAC World Congress, 2005, s. 1021-1021Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

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.

Ort, förlag, år, upplaga, sidor
2005. s. 1021-1021
Nyckelord [en]
Optimization, Decomposition methods, Robust control
Nationell ämneskategori
Teknik och teknologier Reglerteknik
Identifikatorer
URN: urn:nbn:se:liu:diva-36970DOI: 10.3182/20050703-6-CZ-1902.01022Lokalt ID: 33173ISBN: 978-3-902661-75-3 (tryckt)OAI: oai:DiVA.org:liu-36970DiVA, id: diva2:257819
Konferens
16th IFAC World Congress, Prague, Czech Republic, July, 2005
Tillgänglig från: 2009-10-10 Skapad: 2009-10-10 Senast uppdaterad: 2013-10-09
Ingår i avhandling
1. Optimization Algorithms for System Analysis and Identification
Öppna denna publikation i ny flik eller fönster >>Optimization Algorithms for System Analysis and Identification
2004 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

Optimization is a powerful and frequently used tool in many fields of research. In this thesis two relevant and important problems from robust control system analysis and system identification are solved using optimization algorithms.

Many of the most important examples of optimization in control and signal processing applications involve semidefinite programming with linear matrix inequality constraints derived from the Kalman-Yakubovich-Popov lemma. For realistic examples these semidefinite programs have a huge number of variables making them intractable for general purpose solvers. Three customized algorithms for this class of optimization problems are presented and compared to each other. Preprocessing of the semidefinite program that may improve numerical issues are discussed. This preprocessing also makes it possible to relax some assumptions usually made on the semidefinite program. Moreover, it is shown how to use the algorithms for other stability regions than the left half plane.

Even though missing data is quite common in many control and signal processing applications, most system identification algorithms do not address this phenomenon in a good way. This often results in parameter estimates with a large bias. In this thesis the maximum likelihood criterion for identication of Autoregressive models with an exogenous signal subject to missing data is investigated. Two algorithms for identifying the models are presented and are compared to the expectation maximization algorithm. From optimality conditions is computed estimates of the asymptotic variance of the parameter estimates. In addition, it is discussed how a criterion equivalent to the maximum likelihood criterion opens up the possibility to apply a wide range of other optimization algorithms to the estimation problem. It is also shown what property of the data it is that determines why one model is more likely to have produced the data than another. Finally, the multiple optima problem is addressed.

Ort, förlag, år, upplaga, sidor
Linköping: Linköping University, 2004. s. 190
Serie
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 919
Nationell ämneskategori
Reglerteknik
Identifikatorer
urn:nbn:se:liu:diva-98177 (URN)91-85297-19-4 (ISBN)
Disputation
2005-01-14, Visionen, Hus B, Campus Valla, Linköpings universitet, Linköping, 10:15 (Engelska)
Handledare
Forskningsfinansiär
Vetenskapsrådet
Tillgänglig från: 2013-10-09 Skapad: 2013-09-30 Senast uppdaterad: 2013-10-09Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextRelated report

Sök vidare i DiVA

Av författaren/redaktören
Wallin, RagnarHansson, Anders
Av organisationen
ReglerteknikTekniska högskolan
Teknik och teknologierReglerteknik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 65 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf