All Questions
Tagged with matrices nonlinear-optimization
31 questions
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
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
8
votes
0
answers
196
views
Solving matrix equation $X^{-1}=\sum_{i=1}^n D_i X A_i$
Does anybody know an algorithm to solve the following matrix equation?
$$X^{-1}=\sum_{i=1}^n D_i X A_i$$
where $D_i$s are diagonal and $A_i$s are symmetric matrices.
It would be great to have an ...
7
votes
1
answer
373
views
Is the solution of this optimization problem always positive semidefinite?
We are given a set of unit vectors $U \subset \mathbb{C}^n$ which spans the space $\mathbb{C}^n$. Given another unit vector $x$, consider then the following optimization problem:
$$ \sup_H \left\{ x^*...
- 73
7
votes
0
answers
217
views
Characterizing matrices with rank constraint
Given matrix $M\in\Bbb\{0,1\}^{n\times n}$, is there a nice method to characterize $$\mathscr{D}[M]=\{Q\in\Bbb\{0,1\}^{n\times n}:\mathsf{rank}(M-Q)= \mathsf{rank}(Q),\quad M-Q\in\Bbb\{0,1\}^{n\times ...
- 13.9k
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
5
votes
2
answers
480
views
Decomposition of a semi-definite matrix into sums of sparse semi-definite matrices
I'll first provide the background.
Let $x\in\mathbb{R}^N$ be decomposed into $n$ non-overlapping blocks of variables
$x^{(1)},\ldots,x^{(n)}$.
We say that $f:\mathbb{R}^N\rightarrow\mathbb{R}$ is ...
- 51
5
votes
1
answer
523
views
Finding sparsest solution of a linear system
I want to find the solution with most zero-components for the following problem:
$Ax=b$ for $A\in \mathbb{R}^{k\times n}, b \in \mathbb{R}^{k},k<n$, where $x$ is real and has no additional ...
- 183
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
4
votes
3
answers
1k
views
Solving a quadratic matrix equation with fat matrix
I am trying to find an $n \times m$ fat (i.e., $m > n$) matrix $T$ that solves
$$T^T T = X$$
where $X$ is a given $m \times m$ symmetric, positive semidefinite matrix.
I saw this post, but ...
- 143
3
votes
2
answers
3k
views
Sparse approximation of the inverse of a sparse matrix
Is it possible to approximate an inverse of a sparse matrix with a sparse matrix?
The problem comes up in numerical non-linear quasi-Newton optimization: given a sparse Hessian a good starting point ...
- 2,205
3
votes
1
answer
416
views
What's the best orthonormal matrix to align two matrices in the operator norm sense?
Let $A,B \in R^{n\times r}$ with $A^\top B $ invertible. It is known that
\begin{equation}
UV^\top :=\arg\min_{R \in \mathcal{O}^{r\times r}}\|AR-B\|_\mathrm{F},
\end{equation}
where $USV^\top$ is ...
- 515
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
0
answers
83
views
How many local maxima can $(x_1,\dots,x_r)\mapsto\|x_1A_1+\dots+x_rA_r\|_\infty/\|(x_1,\dots,x_r)\|_2$ have for Hermitian $A_1,\dots,A_r$?
Let $K\in\{\mathbb{R},\mathbb{C},\mathbb{H}\}$. Suppose that $A_1,\dots,A_r\in M_n(K)$ are all Hermitian.
Define a function $f_{A_1,\dots,A_r}:\mathbb{RP}^{n-1}\rightarrow[0,\infty)$ by setting
$$f_{...
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 ...
- 362
2
votes
2
answers
338
views
Of all probability matrix $P$ having stationary distribution $\pi$, find the one having smallest diagonal
I am requesting your help today trying to solve a somewhat odd problem. Is there a way to find through some numerical algorithm such as Newton's method the stochastic matrix $\boldsymbol{P}$ having ...
- 23
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
1
vote
3
answers
345
views
How to optimize for the best fit nonuniform-scale-rotation to a given 3×3 matrix?
Given a matrix $L\in \mathbb{R}^{3 \times 3}$, I'm looking for a method to find the closest (in a least squares sense) product of a non-uniform scaling matrix and a rotation matrix:
$$
\min_{s\in\...
- 723
1
vote
1
answer
370
views
Maximizing a certain concave function over a non-convex set
I have been working on a problem which involves maximizing a concave function over a non convex constraint set. The problem is the following $$max. \frac{1}{2}x^TBx\\ s.t.\ x_i(1-x_i)=0,\ \ i=1,\cdots,...
1
vote
0
answers
150
views
Minimax optimization of diagonal entries of function of matrix
Let $\mathbf{A}$ and $\mathbf{U}$ be arbitrary complex $M\times N$ and $N\times M$ matrices, respectively. Let denote superscript $(\cdot)^{\dagger}$ and $(\cdot)^{\mathrm{H}}$ as pseudo-inverse and ...
- 287
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
138
views
Matrix completion in $2\times2$ case by nuclear norm minimization to guarantee rank $1$?
Does fixing diagonal entries and minimizing nuclear norm under weighted sum of entries conditions produce a rank $1$ matrix? I think the answer for this is no.
At least could it be true in $2\times2$ ...
- 13.9k
1
vote
0
answers
63
views
Does the equation $\mathbf{I} = \sum_{k=1}^{m} \mathbf{U} \mathbf{B}_k \mathbf{U}^T\mathbf{A}_k$ have a special name or solution?
I have encountered the equation $\mathbf{I} = \sum_{k=1}^{m} \mathbf{X} \mathbf{B}_k \mathbf{X}^T\mathbf{A}_k$, recently.
All matrices are of dimension $n \times n$.
Is it assigned a special name?
...
- 39
1
vote
0
answers
131
views
Lower bound on the value $\textbf{1}^Tx$ such as $Ax\geq b$
The problem may be formulated as follows:
We are given a set of $m$ positive numbers $\{b_1,...,b_m\}$ and a set of $n$ positive numbers $\{v_1,...,v_n\}$. We have $v_j\leq K$, $j=1,...,n$, for a ...
- 123
0
votes
1
answer
272
views
A certain type of quadratic problem.
I am interested in solving the following equality constrained quadratic (?) problem.
\begin{align}
\min_{u^{H}u=1}~(u^{H}A_1u) \\\
s.t.~ u^{H}A_2u=0
\end{align}
$A_1$ and $A_2$ are $N\times N$ ...
- 1,421
0
votes
1
answer
194
views
Optimization problem involving matrix
I am struggling to solve an optimization problem of the following form:
$$\begin{array}{ll} \underset{A}{\text{maximize}} & \log \det (A) \\ \text{subject to} & a^T A^{-1} a \le b\end{array}$$
...
- 13
0
votes
0
answers
72
views
Minimizing the Spectral Norm of the Hadamard Product of a Quadratic Form Using CVX
I am trying to use CVX to minimize the spectral norm of the Hadamard product of two matrices, one of which is in quadratic form. Specifically, I am trying to minimize $\|{\bf A} \odot {\bf XX}^H\|_2$, ...
- 43
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
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
0
answers
61
views
Solution of a nonlinear system of two equations
Given the matrix $A_{M,N}$ with $N\gt M$, the vector $y$, I have to find the vectors $x$ and $u$, satisfying the following equations:
$$D(x)x=A^Tu$$
$$y=Ax$$
where: $$D(x) = \left| \begin{array}{ccc}
\...
- 399
-2
votes
1
answer
183
views
Property of positive semi-definite
Let $A$ is a positive semi-definite matrix like this:
$$ A = \begin{bmatrix}
1 & \alpha_{1,2} & \alpha_{1,3} & \alpha_{1,4}\\
\alpha_{1,2} & 1 & \alpha_{2,3} & \alpha_{2,4}\\
\...
- 25