Skip to main content

All Questions

1 vote
0 answers
30 views

Optimization of eigenvalue of matrix with discrete variables

Suppose we have a matrix $H$ like this, where $H_{ii}$ is a discrete variable (for example out of $[1,2,3]$) and $H_{ij}$ is a value that depends on the two adjacent values ($H_{ii}$ and $H_{jj}$). $H$...
frgoe's user avatar
  • 31
1 vote
0 answers
27 views

A low-rank approximation problem with rank constraints

I am seeking a solution or some ideas to address the following problem: $$ \begin{aligned} &\text { minimize }_{\widehat{A}, \widehat{B}} \quad\|A-\widehat{A}\|_2 + \|B-\widehat{B}\|_2 \\ &\...
zwebrain's user avatar
0 votes
0 answers
25 views

Best method for sequential small size Hermitian smallest eigenpair problem

I am working on a perhaps rather strange problem. To find the smallest eigenvalue and its eigenvector, for a large number (a few billions) of small (20 * 20 to 200 * 200) Hermitian matrices. These ...
Scriabin's user avatar
2 votes
1 answer
71 views

Minimize $||A-AWW^TA^T||_F$ w.r.t. $W$

Given $n \in \mathbb{N}$ and $A \in \{0,1\}^{n \times n}$, we aim to find $$\arg \min_{W \in \mathbb{R}^{n \times n}} f(W) = ||A-AWW^TA^T||_F,$$ where $||\cdot||_F$ represents the Frobenius norm with $...
Vezen BU's user avatar
  • 2,150
1 vote
0 answers
39 views

Eigenvalue-like problem for two matrices with coupled blocks

For given two real-symmetric matrices $A$ and $B$, both are of size $M \times M$, I'm trying to find two matrices $C_1$ (size $M\times N_1$) and $C_2$ (size $M\times N_2$) such that $$ AC_1 = C_1\...
fidem's user avatar
  • 11
3 votes
0 answers
48 views

When do symmetrical matrices commute?

For context I was taking an optimization course and at one point we used the restriction by line to prove the concavity of $\log det(X)$. Let $g(t) = \log det(X + tV)$ with $V \in S_{n}$ and $t \in \...
Peregrint's user avatar
0 votes
0 answers
6 views

Which divergence or measure is more suitable for graph clustering application using symmetric NMF

Symmetric NMF is a well know tool used for graph clustering applications. Given a similarity matrix $X \in \mathcal{R}^{n\times n}$, symmetric NMF seek to factorize it into o production of the form $...
MathLearner's user avatar
1 vote
0 answers
48 views

Minimizing a log-determinant divergence based function

For a problem of the form $X\approx S$, where $X$ is an $n\times n$ symmetric but not always PD matrix, and $S$ its approximate, I am trying to minimize the log-determinant divergence between $X$ and $...
MathLearner's user avatar
1 vote
0 answers
100 views

Low rank approximation with MSE approach

Suppose that we have a matrix $\mathbf{A}\in\mathbb{R}^{n\times p}$. If we want to find an approximation of $\mathbf{A}$ with maximum rank $k$, which is denoted as $\tilde{\mathbf{A}}$, is it possible ...
Mizera's user avatar
  • 11
0 votes
1 answer
65 views

Maximize trace(UV) subject to $U$ and $V$ being Orthogonal

I am facing an optimization problem where I want to maximize $\operatorname{trace} (U V)$ with respect to $U$ and $V$ where $U$ and $V$ are orthogonal. How can I find the optimal $U$ and $V$? This is ...
Madi's user avatar
  • 43
1 vote
0 answers
60 views

Best inverse / minimization solution of ill conditioned matrix and underdetermined system

I have an ill-conditioned matrix G representing Green's function estimates of a strain model for a rock mass that has been instrumented with optical fiber measuring strain. My problem is seemingly the ...
magmadaddy's user avatar
5 votes
3 answers
140 views

Intuition of $D\leftarrow XC^{T}\text{diag}(C1_n)^{-1}$ update rule in matrix factorization

I am reading this paper where they use Matrix Factorization over Attention mechanism in their Hamburger model. In section 2.2.2 they say, Vector Quantization (VQ) (Gray & Neuhoff, 1998), a ...
WhyMeasureTheory's user avatar
0 votes
0 answers
21 views

How to solve the system of equation $y=\operatorname{Diag}(Bz) x $ with respect $B$ and z

Assume I have the following system of equations: $$y = \operatorname{Diag}(h) x$$ where $x,y, h \in {\bf R}^N$ and suppose that I know them. I also know that $h$ can be factorized as: $$h=Bz$$ where $...
yes's user avatar
  • 888
3 votes
1 answer
105 views

Nearest semi-orthogonal matrix with fixed row

I want to find the nearest (in the Frobenius sense) $n\times d$ (where $n > d$) matrix $X$ to a given matrix $A$ of the same size such that the $d$ columns of $X$ are orthonormal . Since $X$ would ...
Arman's user avatar
  • 65
0 votes
1 answer
76 views

Maximization on trace of quadratic and linear terms under orthonormal constraints

I have the following optimization problem $$ \max_{R: RR^{T}=I} \mbox{Tr} \left( M \left( R A R^{T} - K R^{T} \right) \right) $$ where: $A$ is a rank-one square matrix (assume the first row that are ...
morteza's user avatar
  • 31

15 30 50 per page
1
2 3 4 5 6