All Questions
Tagged with matrices oc.optimization-and-control
107 questions
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
9
votes
2
answers
684
views
A trace-constrained maximization problem in the cone of positive definite matrices
Let $A\in\mathbb{R}^{n\times n}$ be a matrix having eigenvalues with strictly negative real part (in other words, $A$ is supposed to be Hurwitz stable). Let $\mathrm{tr}(\cdot)$ denote the trace ...
- 2,712
2
votes
1
answer
134
views
Quadratic matrix equation for $X\in \mathbb{C}^{ n\times p}$ with Hermitian parameters
Let $A\in \mathbb{C}^{ n\times n}$ and $B \in \mathbb{C}^{p \times p}$ be Hermitian matrices with $p < n$.
Find matrix $X$ such that $X^*AX=B.$
Solution in the case of positive definite $A$ and $...
- 3,741
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
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)...
- 35.4k
8
votes
1
answer
2k
views
Finding Toeplitz matrix nearest to a given matrix
For an arbitrary $N\times N$ Hermitian matrix $A$, I want to derive a Toeplitz matrix from $A$ such that the eigenvectors of both matrices have minimal change.
Specifically I want find the Toeplitz ...
CommunityBot
- 1
8
votes
5
answers
481
views
Nearest matrix orthogonally similar to a given matrix
Given $A,B\in\Bbb R^{n\times n}$ is there technique find $$\min_{ T\in O(n,\Bbb R)}\|A-TBT^{-1}\|_F\mbox{ or }\min_{ T\in O(n,\Bbb R)}\|A-TBT^{-1}\|_2$$ within additive approximation error in $\...
- 13.9k
3
votes
2
answers
2k
views
Proving that a matrix is positive semidefinite
Let matrices $A, B$ be positive semidefinite. Can we prove that $A(I+BA)^{-1}$ is positive semidefinite?
- 1,875
4
votes
1
answer
286
views
Explicit formula for an LMI solution
Suppose we have a linear matrix inequality (aka LMI aka spectahedron aka linear matrix pencil):
$$A_{0}+x_{1}A_{1}+x_{2}A_{2}+\ldots+x_{m}A_{m} \succeq 0.$$
(The notation $X \succeq Y$ means that $X-...
4
votes
1
answer
289
views
A property of positive matrices
Let $\mathbb{S}^{dn} \ni X \succeq 0$ with $d,n \in \mathbb{N}$, where $X \succeq 0$ indicates that $X$ is positive semidefinite. Now partition $X$ into the block form
\begin{gather}
\begin{pmatrix}
...
- 81
1
vote
1
answer
313
views
Nonlinear low-rank approximation - corrected
I would like to state that this is related to a past question of mine which contained errors and now appears in the corrected form, with the erroneous one deleted and closed.
In my research of linear ...
- 2,239
1
vote
1
answer
124
views
Possible analytical way to solve or approximate a specific optimization problem's solution
In my research on linear algebra and optimization, I have come across the following problem repeatedly:
Given constant matrices $C\in\mathbb{R}^{k \times k}$ and $X\in\mathbb{R}^{n \times n}$, $$\...
CommunityBot
- 1
0
votes
1
answer
134
views
Modification of a known optimization problem
In my research of linear algebra and optimization, I wish to modify the following well-known problem:
$ \min \lVert x-Ax \rVert$ subject to $ rank(A)\leq k $ where $ x $ is a given column vector ...
- 1,517
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
2
votes
1
answer
456
views
Constrained optimization over a trace functional
Let $A\in\mathbb{R}^{n\times n}$ be a stable matrix (i.e., the eigenvalues of $A$ have negative real parts). Consider the following optimization problem in $X \in \mathbb{R}^{n \times n}$
$$\begin{...
- 1,538
4
votes
3
answers
1k
views
cayley transform for non-square matrices
Hi,
I am optimizing a function over a matrix $U$, where $U \in \mathbb{R}^{m \times n}$ and $U^TU = I$. I do not want to run a constrained maximization program, since employing the constraint $U^TU = ...
- 13.6k
9
votes
1
answer
847
views
Maximizing a ratio of determinants
Let $D\in\mathbb{R}^{n\times n}$ be a diagonal positive definite matrix s.t. $D\leq I$ ($I$ denotes the $n$-dim. identity matrix) and let $\alpha$ be a strictly positive real number. Consider the ...
- 61.9k
2
votes
1
answer
1k
views
Is the sum of two stable matrices also stable?
Let $A$ and $B$ be two arbitrary real matrices of the same dimension. If the eigenvalues of $A$ and $B$ are all in the left half of the complex plane, can we estimate the the location of the ...
7
votes
1
answer
271
views
Closest point in $SU(n) \otimes SU(n)$ to $SU(n^2)$
What is the closest $V_1 \otimes V_2 \in SU(n)\otimes SU(n)$ in the squared trace inner product to a given $U \in SU(n^2)$? I.e. minimize over $V_1, V_2$:
$\min_{V_1, V_2} | V_1 \otimes V_2 - U|$ in ...
- 108k
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
1
vote
1
answer
606
views
The state-transition-matrix of a physical system,
Here's a simple but potential research problem that I am learning about.
Let's say I am studying a physical system that is governed by N objects. At each time, each object is either "active" and ...
- 1,167
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
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
3
votes
1
answer
523
views
Linear and Isometric Automorphism Groups of the PSD Cone
Let $S_+$ be the cone of psd matrices ($n\times n$ real symmetric positive semidefinite matrices). This cone is a metric space induced from the inner product $\langle A,B\rangle = tr (AB)=tr(BA)$.
...
- 96.4k
1
vote
2
answers
1k
views
Are there some algorithms to solve the diagonal matrix $X$ to the following matrix equation?
Suppose $X$ is an unknown $m \times m$ diagonal matrix. Given a scalar $0<c<1$, and a matrix $A$ of $m \times m$ size whose entries $0<A_{i,j}<1$. Are there some algorithms to find the ...
- 3,741
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
2
answers
606
views
Solving a matrix equation $X=c \cdot AXA' +I$ with a diagonal corrections
I am now struggling to solve the matrix $X \in R^{n \times n}$ in the following equation:
$X=c \cdot AXA' - diag(c \cdot AXA')+ I$,
where
(1) $A \in R^{n \times n}$ is a given matrix whose element ...
- 3,741
0
votes
1
answer
2k
views
eigen-decomposition solution? is it unique?
Assume an N*N covariance matrix (Q) which is a positive definite matrix. The decoder X is assumed to be N*s, where s<=N. X is calculated to be s eigenvectors corresponding to s minimum eigenvalues. ...
CommunityBot
- 1
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
3
votes
1
answer
1k
views
Matrix approximation
Let A be an $m\times n$ matrix and $k$ be an integer. Assume that $A$ is non-negative. We want to find a scalar $\epsilon$ and an $n\times n$ matrix $B$ such that $A\leq A(\epsilon I + B)$ (where $\...
CommunityBot
- 1
4
votes
1
answer
538
views
Rank 1 Approximation of Elementwise Inverse Matrix
I'm wondering whether there is a good way to solve the following optimisation problem.
Given a strictly positive quadratic matrix $A$, find two diagonal matrices $D_1$ and $D_2$ so that
$$ \| D_1 A ...
- 3,741
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?
...
CommunityBot
- 1
-1
votes
1
answer
174
views
Regularized Gradient with respect to a matrix (with a specific structure)
Suppose we have a typical logdet function $\mathcal{L}$
$$
\mathcal{L} = \log\vert \mathbf{I} + \mathbf{A}\mathbf{S} \vert - \mathbf{q}^T(\mathbf{A}^{-1} + \mathbf{S})^{-1} \mathbf{q},
$$
where $\...
CommunityBot
- 1
2
votes
1
answer
1k
views
derivative of sum of singular values
can someone point me to the direction how to calculate the derivatives of a sum of singular values of a matrix?
I am trying to minimize
$$\min_A \parallel A \parallel_*+ \cdots $$ where $\parallel A \...
- 125
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
0
votes
1
answer
203
views
Eigenvalues of a given parametrized matrix.
Let $\mathbf{A}$ and $\mathbf{B}$ be two complex rank-one $N\times N$ positive semi-definite matrices. Let the matrix $\mathbf{C}$ be defined as
\begin{align}
\mathbf{C}=\left(\mathbf{I}*\frac{1}{\...
2
votes
2
answers
765
views
Why eigenvectors optimize this orthogonally constrained nonlinear minimization problem?
Given a $p \times p$ positive definite matrix $\Sigma$, why eigenvectors of $\Sigma$, stacked as columns of a matrix $R \equiv [r_1 \, r_2 \, \ldots \, r_p]$, optimize the following orthogonally ...
- 28.6k
7
votes
3
answers
2k
views
Optimization problem on trace of rotated positive definite matrices
Given two $n \times n$ symmetric positive definite matrices $A$ and $B$, I am interested in solving the following optimization problem over $n \times n$ unitary matrices $R$:
$$
\mathrm{arg}\max_R \,\...
- 7,514
3
votes
1
answer
2k
views
Fast algorithm for maximizing smallest eigenvalue of linear combination of hermitian matrices
I have an engineering back ground. Due to work, I came across this problem
\begin{align}
&\max_{\lambda,y_i\in \mathbb{R}}~\lambda \\\
s.t.~&\left(\mathbf{A}_0+\sum_{i=1}^{K}y_i\mathbf{A}_i\...
- 1,590
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
5
votes
2
answers
429
views
Simultaneous maximization of two Generalized Rayleigh Ritz Ratios
Consider hermitian positive semi-definite matrices $A_1$ and $A_2$. Consider also positive definite matrices $B_1$ and $B_2$. I want to maximize the minimum of the two Generalized Rayleigh Ritz ratios ...
- 342
4
votes
4
answers
703
views
efficient way to compute the inversion of the following matrix
Hi, there
I have looked it up in the current textbook. The conventional numerical method to compute the inversion of an $n \times n$ matrix requires $O(n^3)$. However, for the following special ...
- 2,205
4
votes
2
answers
359
views
A certain type of constrained Rayleigh-Ritz ratio
Let $\mathbf{A_1}$ and $\mathbf{A_2}$ be two hermitian matrices. Consider the problem
\begin{align}
\max_{\mathbf{u}^H\mathbf{u}=1}~\mathbf{u}^H\mathbf{A}_1\mathbf{u} \\\
\mathbf{u}^H\mathbf{A}_2\...
- 27.5k
4
votes
2
answers
1k
views
Minimum eigenvalue of a Affine Combination of two Hermitian matrices
Consider two $N \times N$ hermitian indefinite matrices $A_1$ and $A_2$. Consider their affine combination
\begin{align}
M(t)=(1-t)A_1+tA_2
\end{align}
I am interested in the minimum eigenvalue of $M(...
- 52.3k
2
votes
1
answer
299
views
Rayleight Ritz Ratio and smallest eigenvalue for a set of given matrices
I am familiar with Rayleigh Ritz Ratio for hermitian matrices. Let $A_1$ be a given $N \times N$ hermitian matrix. Then the smallest eigenvalue of $A_1$ is given by
\begin{align}
\lambda_{min}(A_1)=\...
- 52.3k
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
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
3
votes
1
answer
1k
views
What is the minimum of the Frobenius norm in the intersection of positive semidefinite cones?
For scalar variables $x$, we have a simple solution for the following problem.
\begin{eqnarray}
\min_x&&\alpha(x-a)^2+\beta(x-b)^2 \\\
\mathrm{s.t. }&&x\leq a\\\
&&...
- 28.6k
5
votes
2
answers
1k
views
Is a solution of a linear system of semidefinite matrices a convex combination of rank 1 solutions?
The cone of symmetric positive semidefinite $n\times n$ matrices is the convex hull of rank $1$ matrices. That is, every symmetric positive semidefinite matrix is a convex combination of rank 1 ...
- 256
6
votes
1
answer
1k
views
Eigenspace of Euclidean distance matrix.
What is the necessary and sufficient condition (if there is any) that $n$ orthonormal vectors $v_1,v_2,\cdots,v_n$ are eigenvectors of a Euclidean distance matrix. When $n=2$, the orthonormal ...
- 27.7k