Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Low-Rank Exploitation in Semidefinite Programming for Control
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Automatic Control. Linköping University, The Institute of Technology.
2011 (English)In: International Journal of Control, ISSN 0020-7179, E-ISSN 1366-5820, Vol. 84, no 12, 1975-1982 p.Article in journal (Refereed) Published
Abstract [en]

Many control-related problems can be cast as semidefinite programs. Even though there exist polynomial time algorithms and excellent publicly available solvers, the time it takes to solve these problems can be excessive. What many of these problems have in common, in particular in control, is that some of the variables enter as matrix-valued variables. This leads to a low-rank structure in the basis matrices which can be exploited when forming the Newton equations. In this article, we describe how this can be done, and show how our code, called STRUL, can be used in conjunction with the semidefinite programming solver SDPT3. The idea behind the structure exploitation is classical and is implemented in LMI Lab, but we show that when using a modern semidefinite programming framework such as SDPT3, the computational time can be significantly reduced. Finally, we describe how the modelling language YALMIP has been changed in such a way that our code, which can be freely downloaded, can be interfaced using standard YALMIP commands. This greatly simplifies modelling and usage.

Place, publisher, year, edition, pages
Taylor & Francis, 2011. Vol. 84, no 12, 1975-1982 p.
Keyword [en]
Optimization, Semidefinite programming, Linear matrix inequalities, Interior point methods, Modeling software
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:liu:diva-73358DOI: 10.1080/00207179.2011.631148ISI: 000297697600004OAI: oai:DiVA.org:liu-73358DiVA: diva2:471330
Available from: 2012-01-02 Created: 2012-01-02 Last updated: 2017-12-08

Open Access in DiVA

fulltext(367 kB)690 downloads
File information
File name FULLTEXT01.pdfFile size 367 kBChecksum SHA-512
316a0ab3cfd4a9536b4457b05dc213d0936e41693339b9e0bd11557827175c6cfcbc74e00d093e8b73c72c967db0e33968bb542125eefb99f1d208c5383fee72
Type fulltextMimetype application/pdf

Other links

Publisher's full textRelated report

Authority records BETA

Falkeborn, RikardLöfberg, JohanHansson, Anders

Search in DiVA

By author/editor
Falkeborn, RikardLöfberg, JohanHansson, Anders
By organisation
Automatic ControlThe Institute of Technology
In the same journal
International Journal of Control
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 690 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 298 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf