Search for dissertations about: "rank constraints"

Showing result 1 - 5 of 19 swedish dissertations containing the words rank constraints.

2. 1. Rank Reduction with Convex Constraints

   Author : Christian Grussler; Institutionen för reglerteknik; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; low-rank approximation; model reduction; non-convex optimization; Douglas-Rachford; matrix completion; overlapping norm; k-support norm; atomic norm;

   Abstract : 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. READ MORE

4. 2. On low order controller synthesis using rational constraints

   Author : Daniel Ankelhed; Anders Hansson; Anders Helmersson; Anders Forsgren; Linköpings universitet; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; H-infinity synthesis; Linear Matrix Inequalities; rank constraints; polynomial constraints; interior point methods; Automatic control; Reglerteknik;

   Abstract : 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. READ MORE

5. 3. On design of low order H-infinity controllers

   Author : Daniel Ankelhed; Anders Hansson; Anders Helmersson; Jakob Stoustrup; Linköpings universitet; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; H-infinity synthesis; linear systems; linear matrix inequalities; rank constraints; optimization; rational constraints; interior point methods; Automatic control; Reglerteknik;

   Abstract : 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. READ MORE

6. 4. Algorithms in data mining using matrix and tensor methods

   Author : Berkant Savas; Lars Eldén; Lieven De Lathauwer; Linköpings universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Volume; Minimization criterion; Determinant; Rank deficient matrix; Reduced rank regression; System identification; Rank reduction; Volume minimization; General algorithm; Handwritten digit classification; Tensors; Higher order singular value decomposition; Tensor approximation; Least squares; Tucker model; Multilinear algebra; Notation; Contraction; Tensor matricization; Newton s method; Grassmann manifolds; Product manifolds; Quasi-Newton algorithms; BFGS and L-BFGS; Symmetric tensor approximation; Local intrinsic coordinates; Global embedded coordinates; ; Numerical analysis; Numerisk analys;

   Abstract : 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. READ MORE

7. 5. On the Performance Analysis of Cooperative Communications with Practical Constraints

   Author : Quang Trung Duong; Blekinge Tekniska Högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES;

   Abstract : 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. READ MORE