### Citations

1361 | Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
- Sturm
- 1999
(Show Context)
Citation Context ...s, there exist efficient algorithms to solve these SDPs in a time which is polynomial in the number of variables and constraints [6]. Today, there are several solvers freely available, such as SeDuMi =-=[7]-=-, SDPT3 [8] and SDPA [9] just to mention a few. Although SDPs can be solved in polynomial time, the number of variables in the problems often grow rapidly and the time needed to solve the problems can... |

391 |
Linear matrix inequalities in system and control theory
- Boyd, Ghaoui, et al.
- 1994
(Show Context)
Citation Context ...DP) [1] has gained a lot of interest within the control community, and is now a well established mathematical tool in the field. Many fundamental control problems can be cast as semidefinite programs =-=[2]-=-, for example proving robust stability [3], [4], [5]. Moreover, since the beginning of the 90s, there exist efficient algorithms to solve these SDPs in a time which is polynomial in the number of vari... |

311 |
Interior point polynomial methods in convex programming
- Nesterov, Nemirovski
- 1994
(Show Context)
Citation Context ...robust stability [3], [4], [5]. Moreover, since the beginning of the 90s, there exist efficient algorithms to solve these SDPs in a time which is polynomial in the number of variables and constraints =-=[6]-=-. Today, there are several solvers freely available, such as SeDuMi [7], SDPT3 [8] and SDPA [9] just to mention a few. Although SDPs can be solved in polynomial time, the number of variables in the pr... |

235 | Solving semidefinite-quadraticlinear programs using SDPT3
- Tutuncu, Toh, et al.
- 2003
(Show Context)
Citation Context ...ist efficient algorithms to solve these SDPs in a time which is polynomial in the number of variables and constraints [6]. Today, there are several solvers freely available, such as SeDuMi [7], SDPT3 =-=[8]-=- and SDPA [9] just to mention a few. Although SDPs can be solved in polynomial time, the number of variables in the problems often grow rapidly and the time needed to solve the problems can be substan... |

232 | System analysis via Integral Quadratic Constraints
- Megretski, Rantzer
- 1997
(Show Context)
Citation Context ...rol community, and is now a well established mathematical tool in the field. Many fundamental control problems can be cast as semidefinite programs [2], for example proving robust stability [3], [4], =-=[5]-=-. Moreover, since the beginning of the 90s, there exist efficient algorithms to solve these SDPs in a time which is polynomial in the number of variables and constraints [6]. Today, there are several ... |

77 |
Handbook of semidefinite programming: theory, algorithms, and applications
- Wolkowicz, Saigal, et al.
- 2000
(Show Context)
Citation Context ...modeling language YALMIP is changed in such a way that our code can be interfaced using standard YALMIP commands, which greatly simplifies for the user. I. INTRODUCTION Semidefinite programming (SDP) =-=[1]-=- has gained a lot of interest within the control community, and is now a well established mathematical tool in the field. Many fundamental control problems can be cast as semidefinite programs [2], fo... |

77 |
Affine Parameter-Dependent Lyapunov Functions and Real Parametric Uncertainty,”
- Gahinet, Apkarian, et al.
- 1996
(Show Context)
Citation Context ...n the control community, and is now a well established mathematical tool in the field. Many fundamental control problems can be cast as semidefinite programs [2], for example proving robust stability =-=[3]-=-, [4], [5]. Moreover, since the beginning of the 90s, there exist efficient algorithms to solve these SDPs in a time which is polynomial in the number of variables and constraints [6]. Today, there ar... |

36 | Implementation and evaluation of SDPA 6.0 (semidefinite programming algorithm 6.0).
- Yamashita, Fujisawa, et al.
- 2003
(Show Context)
Citation Context ... algorithms to solve these SDPs in a time which is polynomial in the number of variables and constraints [6]. Today, there are several solvers freely available, such as SeDuMi [7], SDPT3 [8] and SDPA =-=[9]-=- just to mention a few. Although SDPs can be solved in polynomial time, the number of variables in the problems often grow rapidly and the time needed to solve the problems can be substantial, even th... |

30 |
LPV system analysis via quadratic separator for uncertain implicit systems
- Iwasaki, Shibata
(Show Context)
Citation Context ... control community, and is now a well established mathematical tool in the field. Many fundamental control problems can be cast as semidefinite programs [2], for example proving robust stability [3], =-=[4]-=-, [5]. Moreover, since the beginning of the 90s, there exist efficient algorithms to solve these SDPs in a time which is polynomial in the number of variables and constraints [6]. Today, there are sev... |

12 |
Specialized fast algorithms for IQC feasibility and optimization problems.
- Kao, Megretski, et al.
- 2000
(Show Context)
Citation Context ...e plant size is modest. Because of this fact, tailor-made solvers for various types of problems have been developed, for example for programs derived from the Kalman-Yakubovic-Popov lemma [10], [11], =-=[12]-=-, [13], [14]. However, a problem with these tailor-made solvers is that they often are limited to very particular control problems, thus making them non-applicable for more complex problems where only... |

6 |
A cutting plane method for solving KYP-SDPs
- Wallin, Kao, et al.
(Show Context)
Citation Context ...en though the plant size is modest. Because of this fact, tailor-made solvers for various types of problems have been developed, for example for programs derived from the Kalman-Yakubovic-Popov lemma =-=[10]-=-, [11], [12], [13], [14]. However, a problem with these tailor-made solvers is that they often are limited to very particular control problems, thus making them non-applicable for more complex problem... |

5 |
A structure exploiting preprocessor for semidefinite programs derived from the Kalman-Yakubovich-Popov lemma
- Wallin, Hansson, et al.
(Show Context)
Citation Context ...ugh the plant size is modest. Because of this fact, tailor-made solvers for various types of problems have been developed, for example for programs derived from the Kalman-Yakubovic-Popov lemma [10], =-=[11]-=-, [12], [13], [14]. However, a problem with these tailor-made solvers is that they often are limited to very particular control problems, thus making them non-applicable for more complex problems wher... |