Sökning: "rank constraints"
Visar resultat 1 - 5 av 19 avhandlingar innehållade orden rank constraints.
1. Rank Reduction with Convex Constraints
Sammanfattning : This thesis addresses problems which require low-rank solutions under convex constraints. In particular, the focus lies on model reduction of positive systems, as well as finite dimensional optimization problems that are convex, apart from a low-rank constraint. LÄS MER
2. On low order controller synthesis using rational constraints
Sammanfattning : In order to design robust controllers, H-infinity synthesis is a common tool to use. The controllers that result from these algorithms are typically of very high order, which complicates implementation. LÄS MER
3. On design of low order H-infinity controllers
Sammanfattning : When designing controllers with robust performance and stabilization requirements, H-infinity synthesis is a common tool to use. These controllers are often obtained by solving mathematical optimization problems. The controllers that result from these algorithms are typically of very high order, which complicates implementation. LÄS MER
4. Algorithms in data mining using matrix and tensor methods
Sammanfattning : In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. LÄS MER
5. On the Performance Analysis of Cooperative Communications with Practical Constraints
Sammanfattning : With the rapid development of multimedia services, wireless communication engineers may face a major challenge to meet the demand of higher data-rate communication over error-prone mobile radio channels. As a promising solution, the concept of cooperative communication, where a so-called relay node is formed to assist the direct link, has recently been applied to alleviate the severe pathloss and shadowing effects in wireless systems. LÄS MER