×

Low-rank exploitation in semidefinite programming for control. (English) Zbl 1236.90090

Summary: 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.

MSC:

90C22 Semidefinite programming
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Ben-Tal A, Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, MPS-SIAM Series on Optimization (2001) · Zbl 0986.90032
[2] DOI: 10.1145/1356052.1356057 · Zbl 1291.65173 · doi:10.1145/1356052.1356057
[3] DOI: 10.1137/1.9781611970777 · Zbl 0816.93004 · doi:10.1137/1.9781611970777
[4] Falkeborn R, in Proceedings of the 15th IEEE International Symposium on Computer Aided Control System Design (2010)
[5] Fujisawa K, Mathematical Programming 79 pp 235– (1997)
[6] DOI: 10.1109/9.486646 · Zbl 0854.93113 · doi:10.1109/9.486646
[7] Gahinet P, LMI Control Toolbox (1995)
[8] DOI: 10.1137/0806020 · Zbl 0853.65066 · doi:10.1137/0806020
[9] Helmersson, A. 1994. Model Reduction using LMIs. Proceedings of the 33rd IEEE Conference on Decision and Control. 1994. pp.3217–3222. Orlando, FL
[10] DOI: 10.1109/9.940924 · Zbl 1006.93053 · doi:10.1109/9.940924
[11] DOI: 10.1080/00207170903334813 · Zbl 1226.90065 · doi:10.1080/00207170903334813
[12] DOI: 10.1016/j.automatica.2003.09.016 · Zbl 1034.93021 · doi:10.1016/j.automatica.2003.09.016
[13] DOI: 10.1137/S1052623494269035 · Zbl 0872.90098 · doi:10.1137/S1052623494269035
[14] Leibfritz F, Technical Report (2004)
[15] Liu, Z and Vandenberghe, L. 2007. Low-rank Structure in Semidefinite Programs Derived from the KYP Lemma. Proceedings of the 46th IEEE Conference on Decision and Control. 2007. New Orleans, Louisiana
[16] Löfberg J, in IEEE International Symposium on Computer Aided Control Systems Design pp 284– (2004)
[17] DOI: 10.1109/9.587335 · Zbl 0881.93062 · doi:10.1109/9.587335
[18] DOI: 10.1137/S1052623495293056 · Zbl 0913.65051 · doi:10.1137/S1052623495293056
[19] Nesterov YE, in Studies in Applied Mathematics (1994)
[20] DOI: 10.1287/moor.22.1.1 · Zbl 0871.90064 · doi:10.1287/moor.22.1.1
[21] DOI: 10.1109/TAC.2010.2041984 · Zbl 1368.93077 · doi:10.1109/TAC.2010.2041984
[22] DOI: 10.1080/10556789908805766 · Zbl 0973.90526 · doi:10.1080/10556789908805766
[23] DOI: 10.1007/s10107-002-0347-5 · Zbl 1030.90082 · doi:10.1007/s10107-002-0347-5
[24] Vandenberghe L, Positive Polynomials in Control, Lectures Notes in Control and Information Science (2004)
[25] DOI: 10.1109/TAC.2009.2014922 · Zbl 1367.90081 · doi:10.1109/TAC.2009.2014922
[26] DOI: 10.1016/j.automatica.2007.06.026 · Zbl 1283.90028 · doi:10.1016/j.automatica.2007.06.026
[27] DOI: 10.1007/978-1-4615-4381-7 · doi:10.1007/978-1-4615-4381-7
[28] DOI: 10.1080/1055678031000118482 · Zbl 1106.90366 · doi:10.1080/1055678031000118482
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.