All Questions
Tagged with matrices oc.optimization-and-control
107 questions
12
votes
5
answers
9k
views
Solving Lyapunov-like equation
The following matrix equation might be a Lyapunov-like equation, but it seems hard for me to develop a simpler way to solve it. From the computation effort, I need some help for solving the special ...
- 121
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
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 ...
- 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
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
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 ...
- 495
8
votes
1
answer
2k
views
Symplectic block-diagonalization of a real symmetric Hamiltonian matrix
Given a $2n\times 2n$ real, symmetric, Hamiltonian matrix $W$ (anticommutes with the symplectic metric), is there an orthogonal, symplectic matrix $R$ such that $R^\top WR$ is block-diagonal?
Being ...
- 315
8
votes
2
answers
380
views
Projecting onto space of matrices with spectral radius less than one
Consider the space
$$ S = \left\{ A \in \mathbb{R}^{n \times n} : \mathrm{SpectralRadius}(|A|) \leq 1 \right\}$$
where $|A|$ is the entry-wise absolute value. Given a matrix $M \in \mathbb{R}^{n\times ...
- 123
7
votes
2
answers
486
views
The odd power of copositive matrix
If $A$ is copositive, what about $A^3$? Is it also copositive? More generally,
my question is whether the odd power of a copositive matrix is still copositive.
Any reference is appreciated
- 1,858
7
votes
3
answers
6k
views
Minimize trace of inverse of convex combination of matrices.
Hello! (First question--please forgive me if its unclear.)
I am interested in efficient/approximate optimization techniques for minimizing a norm of a convex combination of symmetric, positive semi-...
- 181
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 \,\...
- 362
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 ...
- 2,099
6
votes
3
answers
3k
views
minimize the sum of absolute eigenvalues
Hi,
We have a real symmetric matrix M with diagonal elements 0's, the eigenvalues and eigenvectors of M are computed.
Now we wish to change its diagonal elements arbitrarily to minimize the sum of ...
6
votes
1
answer
1k
views
Solve equation with matrix variable
I want to solve a matrix $\Omega$ from a equation $\sum_k (\Omega + \Theta_k)^{-1} = Q$. The $Q$ and $\Theta, \forall k=1,\ldots,K$ are known, and are positive definite matrices. $\Omega$ also has to ...
- 173
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 ...
- 1,858
5
votes
3
answers
3k
views
A nice necessary and sufficient condition on positive semi-definiteness of a matrix with a special structure
Let
$$
A =
\begin{pmatrix}
\sum_{j\ne 1}a_{1j} & -a_{12} & \cdots & -a_{1n}\\
-a_{21} & \sum_{j\ne 2}a_{2j} & \cdots & -a_{2n}\\
\vdots & \vdots & \ddots & \...
5
votes
2
answers
680
views
Finding the solution to b = Ax that minimizes the Hamming weight (everything over the field F_2).
Is there an efficient algorithm for finding the solution $x$ of
$b = Ax$
that minimizes the Hamming weight of $x$, where
$A$ is a nxm-matrix over the field $\mathbb{F}_2$ ("integer matrix modulo 2")...
- 141
5
votes
1
answer
335
views
Projecting a symmetric matrix onto the space of linear operators with a particular eigenvalue
Specifically, I am interested in the case where one eigenvalue is exactly $0$. Given an $n \times n$ symmetric matrix, I would like to find the closest $n\times n$ symmetric matrix that has one ...
- 245
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 ...
user2529
5
votes
2
answers
343
views
Maximal eigenvalue of a correlation matrix with some entries fixed as zeros
Let $A$ be real a positive semidefinite matrix of dimension $n$ and with $1$s on the diagonal. Those matrices are sometimes referred to as correlation matrices. From the positivity of the minors, we ...
- 51
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 ...
- 1,421
5
votes
1
answer
261
views
Bounds on number of "non-metric" entries in matrices
Question:
what upper bounds are known on the number of non-metric entries of finite dimensional square matrices $\boldsymbol{A}\in\mathbb{R}^{n\times n}$ with strictly positive off-diagonal elements $...
- 13.2k
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(...
- 1,421
4
votes
1
answer
7k
views
Matrix optimization problem
This is (probably) an easy one:
Given a positive definite matrix $M$, find the positive definite matrix $X$, which minimizes $\textrm{tr}(X M)$ subject to $\det(X) = 1$.
Looking for how to find X, ...
- 379
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 = ...
- 263
4
votes
2
answers
1k
views
Optimizing over matrices with spectral radius <1?
Suppose $F(x)$ is a convex objective function on $n\times n$ matrices, and I need to numerically optimize $F$ with the condition that $x$ has spectral radius less than $1$. This might be too hard, so ...
- 2,442
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 ...
- 41
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
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\...
- 1,421
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-...
- 6,962
4
votes
1
answer
254
views
Max-norm projection of a Hermitian matrix onto the set of positive semidefinite matrices
For a given Hermitian matrix $A$ (i.e. complex matrix with $A_{ij}^{\ast}=A_{ji}$) find its max-norm projection onto the set of complex positive semi-definite matrices:
$$\Pi(A)=\mathrm{argmin}_{M\...
- 41
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 ...
- 909
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
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?
- 41
3
votes
2
answers
246
views
$\min(\det(\mathbf{A}))$ for special matrix $\mathbf{A}$
(The construction of matrix $\mathbf{A}$ is not difficult to be understood. You can first jump to A Toy Example to take a glance. Any idea or suggestion would be appealing for me.)
The Original ...
- 133
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\\\
&&...
- 607
3
votes
1
answer
730
views
Computational complexity of low rank SDP
Suppose we are given a general semidefinite program (SDP) of the form with an additinal rank requirement
\begin{array}{rl} {\displaystyle\min_{X \in \mathbb{S}^n}} & \langle C, X \rangle_{\mathbb{...
- 1,503
3
votes
1
answer
3k
views
How do I optimize over (or take derivative wrt) a square diagonal matrix?
I would like to solve the following optimization problem in $k$-vector $w_i$
$$ \min_{w_i} \quad \left\|P_i - X \mbox{diag} (w_i) Y^T \right\|_F^2 $$
where $P_i$ is a $6 \times 6$ matrix, $X$ and $Y$ ...
- 33
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 $\...
- 145
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)$.
...
user2529
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,421
3
votes
1
answer
255
views
Minimizing quadratic objective under orthogonality constraints
The following problem is motivated from Generalized Procrustes Analysis. I am wondering if it is possible to obtain a closed form minimizer (which may involve SVD or some other decomposition of a ...
- 161
3
votes
1
answer
1k
views
Maximize the multiplicity of an eigenvalue
Hi,
We have a real, non-singular and symmetric matrix M of size n by n, with diagonal elements 0's. Its eigenvalues and eigenvectors are computed.
Now we wish to change its diagonal elements ...
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