The tag has no wiki summary.

learn more… | top users | synonyms

6
votes
1answer
289 views

On the positivity of matrices

For given $n$, the following $n\times n$ real matrix $M=M^{T}$ is called positive, if $x^{T}M x\geq 0$ holds for all non-negative real $x_1,x_2,\cdots,x_n$, where $x=(x_1,x_2,\cdots,x_n)^T$. ...
1
vote
1answer
61 views

mixed semi definite and second order programming complexity order

Consider the following mixed semi definite and second order programming: $\begin{array}{l} \mathop {{\rm{min}}}\limits_{\bf{X}} \,{\rm{Tr}}\left( {{\bf{XA}}} \right)\\ {\rm{s}}{\rm{.t:}}\, & ...
0
votes
1answer
152 views

Positive Semidefinite matrix [closed]

Let $A$ be an $n\times n$ symmetrix matrix, if $\forall i$, $a_{ii}\geq |a_{ij}|,\forall j$ satisfies, can we say that $A$ is a positive semidefinite matrix? I tried to find a counter example, but ...
1
vote
0answers
61 views

dual problem of SDP [closed]

suppose we have the following optimization problem: \begin{array}{l} \mathop {\min }\limits_{{\bf{X}},{\bf{x}}} \,\,Tr\left( {{\bf{XA}}} \right) + 2{{\bf{a}}^H}{\bf{x}} + b\\ s.t:\,\,\,\,\left[ ...
2
votes
1answer
145 views

Optimization problem whose cardinality never exceeds 7 for some reason

I am working on a problem in which I have a collection of $n$ points, $x_1,\dots,x_n$, in the plane, as well as a positive definite matrix $\Sigma$ and another point $\mu$ in the plane. I am trying ...
1
vote
0answers
177 views

An optimization problem on the sphere

Let $S$ be a sphere centered at origin in $\Bbb R^{2n}$ of radius $\sqrt{2n}$. Let $D$ be a diagonal matrix. Let $U$ be an orthogonal matrix. Let $r\in\Bbb Z_+$ be a fixed integer. Let vector ...
0
votes
1answer
107 views

On the upper bound of Hermitian matrices

Suppose we are given a Hermitian matrix $A$, how to describe the following set of Hermitian $S=\{X:X\geq \pm A\}$, where $Y\geq B$ is $Y-B$ is semidefinite matrix. This is of course a convex set, and ...
3
votes
1answer
152 views

SDP formulation of noisy low rank matrix completion

Exact low rank matrix completion using nuclear norm minimization can be formulated as a semidefinite program (SDP). Following the notation in the paper, a convex problem for noisy matrix completion ...
0
votes
0answers
22 views

weakly Complementary slackness

Suppose we have a general pair of primal-dual semidefinite programming and strong duality holds. What does mean the term "weakly Complementary slackness condition" in optimality?
1
vote
1answer
129 views

Lagrange multiplier and semidefinite programming

suppose we have a primal semidefinite programming. for finding its dual we use Lagrange multiplier $w_i$ for each semidefinite constraint. If the Lagrange multiplier be zero for one constraint what we ...
0
votes
0answers
95 views

How could I prove this equality for eigenvalues of Laplacian matrix?

I would be glad if you have some comments that how I could prove following statement. Suppose that graph $G =(N, E)$ be given. The the following program computes the $k$-smallest eigenvalues of the ...
2
votes
1answer
176 views

positive semidefinite matrix condition

There is a great work of Alizadeh that in section 4 speaks about Minimizing sum of the first few(k-largest) eigenvalues of a symmetric matrix. Instead of a symmetric model we use the weighted ...
1
vote
0answers
60 views

Checking feasibility with eigenvalue and linear constraints

Is there an efficient algorithm to check the simultaneous feasibility of linear and eigenvalue constraints? For example, given $ \lambda_1 \ge \lambda_2 \ge 0$, is the following problem efficiently ...
0
votes
1answer
197 views

Bounding the positive semi-definite matrix with its block diagonal matrix [closed]

Can we bound $\mathbf{A}$ with $\mathbf{A^*}$ as ${\bf{A}} \preceq {{\bf{A}}^*}$ where \begin{equation} {\bf{A}} = \left[ {\begin{array}{*{20}{c}} {{{\bf{A}}_{11}}}&{...}&{{{\bf{A}}_{1N}}}\\ ...
3
votes
1answer
153 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 ...