LMIs in Control/Minimum-Rank Solutions of Linear Matrix Equations/Low-Dimensional Euclidean Embedding Problem

From testwiki
Revision as of 22:35, 8 November 2019 by imported>Rezajamesahmed
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

WIP

LMIs in Control/Minimum-Rank Solutions of Linear Matrix Equations/Low-Dimensional Euclidean Embedding Problem


This is a Template for Creating An LMI Page


The System

x˙(t)=Ax(t)x(0)=x0

The Data

A List of inputs needed for the problem to be well-defined.

The Optimization Problem

A description of the Problem to be solved, if appropriate.


The LMI: The Lyapunov Inequality

Title and mathematical description of the LMI formulation.

FindX:[X]>0[ATX+XA]<0

Conclusion:

Interpretation of the results of the LMI

Implementation

A link to CodeOcean or other online implementation of the LMI

Links to other closely-related LMIs

A list of references documenting and validating the LMI.


Return to Main Page:

Template:BookCat