Skip to main content

All Questions

Filter by
Sorted by
Tagged with
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 $\...
Turbo's user avatar
  • 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 ...
CComp's user avatar
  • 123
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 ...
Wei Liu's user avatar
  • 173
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 ...
dineshdileep's user avatar
  • 1,421
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{...
gondolf's user avatar
  • 1,503
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 ...
Norouzi's user avatar
  • 362
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: $$ \...
Shreyas B.'s user avatar
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\...
Alec Jacobson's user avatar
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 ...
hichem hb's user avatar
  • 377
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}$$ ...
user164237's user avatar
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 $...
cfp's user avatar
  • 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\...
fengbiqian's user avatar