All Questions
Tagged with matrices oc.optimization-and-control
34 questions with no upvoted or accepted answers
12
votes
2
answers
800
views
A (linear) optimization problem subject to (linear) matrix inequality constraints
Let $A \in \mathbb{R}^{n \times n}$ be a Hurwitz matrix, i.e. $A$ satisfies $\mathrm{Re}\,\lambda_i< 0$, where $\{\lambda_i\}_{i=1}^n$ is the set of eigenvalues of $A$. Suppose that the trace of $A$...
- 2,712
4
votes
1
answer
228
views
A question on eigenvalue of parametric matrix
Is there a way to efficiently check if all matrices in the following set are Hurwitz stable (eigenvalues strictly in the left-hand plane)?$$\left\{ A \in \Bbb R^{n \times n} : \ell_{i,j}\leq A_{i,j} \...
- 1,216
4
votes
0
answers
249
views
Is every stable matrix orthogonally similar to a $D$-skew-symmetric matrix?
Let $\mathrm{diag}(A)$ denote the diagonal matrix with diagonal entries of $A\in\mathbb{R}^{n\times n}$ and let $\succeq$ denote the standard partial order in the cone of (symmetric) positive definite ...
- 2,712
4
votes
0
answers
82
views
Non-singularity of a series of matrices
Let $A_1$, $A_2$ be $n\times n$ real matrices. Suppose that $A_1$ and $A_2$ are Schur stable (i.e., their eigenvalues are strictly inside the unit circle in the complex plane). Let $B_1$, $B_2$ be two ...
- 2,712
3
votes
0
answers
111
views
Approximate inverse of large sparse matrix
Given a large sparse matrix $M$, how to determine the existence of a good preconditioner? In other words, does there exist a sparse matrix $X$ such that $X M$ is close to the identity with respect to ...
- 31
3
votes
0
answers
243
views
An inequality concerning the solution of a Lyapunov equation
Let $A$ be an Hurwitz stable matrix (i.e. the real part of the eigenvalues of $A$ lie in the left-half plane) and $Q$ be a positive semidefinite matrix ($Q\ge 0$, for short). Let $P>0$ be the ...
- 2,712
3
votes
0
answers
298
views
Singular value decomposition of a low rank weak diagonally dominant M-matrix. When is the unitary polar matrix positive semi-definite?
Let $A$ be an $n \times n$, non-symmetric, real, weak diagonally dominant M-Matrix. Its diagonal is strictly positive, its off-diagonal is negative or zero and all its columns sum to zero. $A$ has ...
- 323
3
votes
0
answers
149
views
Copositivity under tensor products
Is there any symmetric real matrix $A$ such that $A^{\otimes n}$ is copositive for all positive integers $n$, but such that A is neither positive semidefinite nor has just non-negative entries?
...
- 31
3
votes
0
answers
466
views
An optimization problem over real symmetric matrices
Given an $n\times s$ matrix $P$ of positive real numbers and $T\geq n$, find (either by a formula or an algorithm) the real symmetric $n\times n$ Z-matrix $A$ which maximizes $\min\limits_{1\leq i<...
- 767
3
votes
0
answers
125
views
Copositivity in matrix pencils
Given two square symmetric matrices $A,B$ of the same order, the matrix pencil $P(A,B)$ is the set of linear combinations of $A$ and $B$. Finsler's theorem gives an elegant criterion for $P(A,B)$ to ...
- 6,962
2
votes
0
answers
72
views
Gradient descent over the set of complex symmetric matrices
In the course of my research (somewhat related to compressive sensing), I am trying to determine a complex, symmetric matrix $L$ (i.e. $L = L^T$) through the following optimization formulation:
$$ \...
- 21
2
votes
0
answers
248
views
A parametrization of stable matrices
Let $A\in\mathbb{R}^{n\times n}$ be a diagonalizable matrix with real and strictly negative eigenvalues. Furthermore, suppose that $\mathrm{tr}(A)=-1$.
My question. I'm wondering whether it is ...
- 2,712
2
votes
0
answers
90
views
Singularities of the Quantum propagator (baby version)
Given $a,b \in \mathfrak{su}(4)$ which are taken to generate the whole algebra, consider the following map $V:\mathbb{R}^{2} \rightarrow SU(4)$:
$V : (w_1, w_{2}) \mapsto e^{(a+w_2 b)} e^{(a+w_1 b)}$
...
- 2,099
2
votes
0
answers
172
views
Optimization with random matrix
Consider $J$ a random matrix of size $n\times n$ with i.i.d. Gaussian entries $J_{ij} \sim \mathcal{N}(0,\sigma^2/n)$. Let $f(x)=tanh(x)$, and for $x\in\mathbb{R}^n$, $f(x)$ denotes the vector where $...
- 840
2
votes
0
answers
1k
views
Incoherence of the row/column span
Due to V.Chandrasekaran., et al (p.11) : In general for any $k$-dimensional subspace of $A_{n×n}$ we have that:
$$\sqrt{(k/n)} \leq incoherence(A)\leq 1$$
where the lower bound is achieved (for ...
- 21
2
votes
0
answers
240
views
Copositive matrix?
I want to check under what conditions a matrix of the form $\alpha J -Q$ is copositive, where $J$ is the all-ones matrix and $Q$ is doubly nonegative (i.e. entrywise nonnegative and positive ...
- 6,962
1
vote
0
answers
63
views
The rank of a matrix expression
I'm studying discrete-time LTI systems and state estimators for them. Recently, I studied this paper. I am facing a matrix rank calculation problem and having trouble solving it. I will provide more ...
- 4,484
1
vote
1
answer
67
views
Low rank matrices which preserve maximizers of quadratic form
Suppose $x, y \in \{0,1\}^d$ are binary vectors. For a matrix $M$ consider the quadratic form,
\begin{align}
x^T M y + (\mathbb{1} - x)^T M (\mathbb{1} - y)
\end{align}
Does there exist an $M$ such ...
- 297
1
vote
1
answer
519
views
Optimal transport between two matrices
I'm investigating the use of optimal transport to define a distance between non-negative matrices that satisfy the condition $\mathbf e^\top\mathbf M\mathbf e = 1$ (i.e., the sum of all elements in ...
- 243
1
vote
0
answers
49
views
Bounds on Eigenvalues After Skew-Symmetric Perturbation
Consider two matrices $\mathbf{J} \in \mathbb{R}^{n \times n}$ and $\mathbf{L} = -\mathbf{L}^T \in \mathbb{R}^{n \times n}$. I am trying to upper bound the eigenvalues of their sum:
$$\mathbf{A} = \...
- 11
1
vote
0
answers
78
views
Is there an efficient way to do semidefinite programming with a Lyapunov equation constraint?
I am trying to numerically solve semidefinite programs of the form
$$\begin{array}{ll} \underset{X,Y}{\text{minimize}} & \operatorname{tr}(AX)\\ \text{subject to} & BY + YB = X\\ & X, Y \...
- 31
1
vote
0
answers
514
views
Minimizing the Frobenius norm of a quadratic matrix expression
Given matrices $R \in \mathbb R^{m \times n}$ and $Y \in \mathbb R^{p \times n}$, where $R$ is full rank, how can I solve the following optimization problems?
$$\min_{X \in \mathbb R^{p \times m}} \| ...
- 11
1
vote
0
answers
152
views
solving a non-linear Matrix equation
I am working on a problem of optimization of wireless sensor networks in order to achieve the optimal power allocation in the network. I find an equality matrix problem that can be written as ...
- 377
1
vote
0
answers
163
views
Bounds of Procrustes problem
We denote $\|\cdot\|_F$ as the Frobenius norm of some matrix. We define $f: \mathbb{R}^{d\times r}\times\mathbb{R}^{d\times r} \rightarrow \mathbb{R}^{d\times r}$ as the following:
\begin{align}
f(A,B)...
- 11
1
vote
0
answers
141
views
For of a special case of $Ax>=b$, are there always integer solutions?
The input consists of two integers $n\geq 2$ and $K\geq 2$, and a vector of positive integers $b$ of size $n$. We assume that $\sum_i b_i$ is a multiple of $K$.
The output is a matrix $A(n\times n)$ ...
- 123
1
vote
0
answers
221
views
Nonunique low-rank matrix completion from a few entries
Suppose we want to have a good approximation for the following NP-hard problem
$$\min_{\bf X} \operatorname{rank}({\bf X}) \text{ s.t. } \mathcal{A}({\bf X}) = {\bf b}, {\bf X} \succeq 0$$
where ${\bf ...
- 449
1
vote
0
answers
576
views
Minimizing quadratic form over permutations
Let $Q$ be an $n \times n$ real symmetric matrix and $x$ an $n \times 1$ real vector. Consider the following minimization problem:
$\min_{\pi \in S_n} ~(\pi x)^{\rm T} Q (\pi x)$,
where $S_n$ ...
- 1,839
0
votes
0
answers
53
views
Relations between the optimal solutions of two related SDPs
In system theory, we often encounter Semi-Definite Programs (SDPs) with Linear Matrix Inequality (LMI) constraints, such as those presented in this paper. I have introduced new variables based on the ...
- 4,484
0
votes
0
answers
159
views
Double summation of matrices as constraints in convex optimization in CVX
I want to implement the following optimization problem from the following paper Randomized Gossip Algorithms, Page 10 Eq 53:
\begin{align}
\text{minimize} &\qquad s\\
\text{subject to} & \...
0
votes
0
answers
46
views
Lipschitz solutions to linear complementarity problems (LCP)
Let $M\in\mathbb{R}^{n\times n}$.
For $q\in\mathbb{R}^n$, define the set:
$$S_M(q)=\{y\in\mathbb{R}^n|y\ge 0,q+My\ge 0, y^\top (q+My)=0\}.$$
This is the set of solutions to the LCP $(q,M)$.
We say $...
- 183
0
votes
0
answers
193
views
Rewriting Kronecker product
im considering a pole placement problem in control theory and my controler has a specific form:
$$R=I_n\otimes q$$
where $I_n$ is the identitiy matrix of size $n$ and $q\in\Re^k$ is a vector of the ...
- 1
0
votes
0
answers
113
views
Reference for matrix Lyapunov function / matrix dynamic system / stability
We usually consider $\dot{x} = f(x)$, where $x$ is a vector.
Now, I want to consider $$\dot{X}=f(X,U),$$ where $X$ is a square matrix $\mathbb{R}^{n\times n}$ state, $U$ is a square matrix variable $\...
- 101
0
votes
0
answers
95
views
How to maximum L1 norm problem?
I have met a problem these days.
\begin{equation}
\underset{\omega}{\max} \quad \Vert \text{diag}(\mathbf{h}^H)\mathbf{G}^H\mathbf{\omega}\Vert_1 \\
s.t.\quad\mathbf{\omega}^H\mathbf{G}\mathbf{G}^H\...
- 171
0
votes
1
answer
180
views
(probably simple) optimization question
Suppose you have a concave function defined over a non-polyhedral convex cone and you are interested in the infimum. What would be standard approaches to tackle the question? (The cone is actually PSD ...
- 6,962