Sökning: "semidefinite programming"
Visar resultat 1 - 5 av 13 avhandlingar innehållade orden semidefinite programming.
1. Model Reduction Using Semidefinite Programming
Sammanfattning : In this thesis model reduction methods for linear time invariant systems are investigated. The reduced models are computed using semidefinite programming. Two ways of imposing the stability constraint are considered. However, both approaches add a positivity constraint to the program. LÄS MER
2. On Some Properties of Interior Methods for Optimization
Sammanfattning : This thesis consists of four independent papers concerningdifferent aspects of interior methods for optimization. Threeof the papers focus on theoretical aspects while the fourth oneconcerns some computational experiments. LÄS MER
3. Model Order Reduction Based on Semidefinite Programming
Sammanfattning : The main topic of this PhD thesis is complexity reduction of linear time-invariant models. The complexity in such systems is measured by the number of differential equations forming the dynamical system. This number is called the order of the system. LÄS MER
4. Integer Quadratic Programming for Control and Communication
Sammanfattning : The main topic of this thesis is integer quadratic programming with applications to problems arising in the areas of automatic control and communication. One of the most widespread modern control methods is Model Predictive Control (MPC). In each sampling time, MPC requires the solution of a Quadratic Programming (QP) problem. LÄS MER
5. Structure Exploitation in Semidefinite Programming for Control
Sammanfattning : Many control problems can be cast as semidefinite programs. However, since the size of these problems grow quite quickly, the computational time to solve them can be quite substantial. In order to reduce the computational time, many proposals of how to tailormake algorithms to various types of control problems can be found in the literature. LÄS MER
