Skip to main content

All Questions

4 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
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
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
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