Question

Algorithm for LMI optimization of PSD matrix

score 59 · Answer 1 · 2026-03-25 02:57:15

59

Views

Algorithm for LMI optimization of PSD matrix

Published on 25 Mar 2026 - 2:57

score 77 · Answer 2 · 2019-12-30 03:12:26

77

Views

Solving for $x_i$ and $y_i$ in this system: $(\mu-x_1)y_1+(x_2-\mu)y_2=d$, $x_1y_1+x_2y_2=\mu$, $y_1+y_2=1$

Published on 30 Dec 2019 - 3:12

score 210 · Answer 3 · 2020-01-05 17:16:39

210

Views

Projected gradient descent on a semidefinite program with multiple constraints

Published on 05 Jan 2020 - 17:16

score 77 · Answer 4 · 2020-01-07 16:07:16

77

Views

Analytical solution for semidefinite program

Published on 07 Jan 2020 - 16:07

score 244 · Answer 5 · 2026-03-25 04:38:19

244

Views

Converting nonlinear matrix inequality to an LMI

Published on 25 Mar 2026 - 4:38

score 52 · Answer 6 · 2020-01-30 08:45:25

52

Views

Reference to this Young Inequality for matrices

Published on 30 Jan 2020 - 8:45

score 207 · Answer 7 · 2020-02-19 09:59:31

207

Views

How to prove the $n\times n$ matrix $A=\big(\frac{1}{i+j+1}\big)_{i,j\in [n]}$ is positive semi-definite?

Published on 19 Feb 2020 - 9:59

score 113 · Answer 8 · 2020-02-25 16:02:04

113

Views

When applying semidefinite optimization to sum of squares polynomials, why do you want the determinant of you polynomial matrix to be non-negative?

Published on 25 Feb 2020 - 16:02

score 26 · Answer 9 · 2020-02-27 11:28:49

26

Views

Why is a matrix $Z = (<u_iu_i^T,u_ju_j^T>)_{i,j\in [n+1]}$ with $\{u_i\}_{i\in[n]}$ orthonormal representation of a graph positive semi-definite?

Published on 27 Feb 2020 - 11:28

score 249 · Answer 10 · 2026-03-25 03:22:18

249

Views

Given a closed, convex, full-dimensional cone $K$, how do I show that $u\in int(K) \iff u^tx>0 \quad \forall x\in K^*-\{0\}$?

Published on 25 Mar 2026 - 3:22

score 124 · Answer 11 · 2020-03-04 16:49:28

124

Views

Optimal value of the semi-definite programming and slater's condition

Published on 04 Mar 2020 - 16:49

score 111 · Answer 12 · 2020-03-05 01:11:06

111

Views

Strong duality in SDP

Published on 05 Mar 2020 - 1:11

score 250 · Answer 13 · 2020-03-06 11:00:24

250

Views

Prove that $X$ is PSD $\iff$ the principal submatrix of $X$ with all maximally linearly independent columns (and corresponding rows) left is PD.

Published on 06 Mar 2020 - 11:00

score 64 · Answer 14 · 2020-03-07 13:58:49

64

Views

Can we rewrite $\prod \frac{e^{y_i}}{y_i}$ in any way?

Published on 07 Mar 2020 - 13:58

score 79 · Answer 15 · 2026-02-23 03:23:36

79

Views

What are mathematicians talking about when using the term programming?

Published on 23 Feb 2026 - 3:23

List Question

Algorithm for LMI optimization of PSD matrix

Solving for $x_i$ and $y_i$ in this system: $(\mu-x_1)y_1+(x_2-\mu)y_2=d$, $x_1y_1+x_2y_2=\mu$, $y_1+y_2=1$

Projected gradient descent on a semidefinite program with multiple constraints

Analytical solution for semidefinite program

Converting nonlinear matrix inequality to an LMI

Reference to this Young Inequality for matrices

How to prove the $n\times n$ matrix $A=\big(\frac{1}{i+j+1}\big)_{i,j\in [n]}$ is positive semi-definite?

When applying semidefinite optimization to sum of squares polynomials, why do you want the determinant of you polynomial matrix to be non-negative?

Why is a matrix $Z = (<u_iu_i^T,u_ju_j^T>)_{i,j\in [n+1]}$ with $\{u_i\}_{i\in[n]}$ orthonormal representation of a graph positive semi-definite?

Given a closed, convex, full-dimensional cone $K$, how do I show that $u\in int(K) \iff u^tx>0 \quad \forall x\in K^*-\{0\}$?

Optimal value of the semi-definite programming and slater's condition

Strong duality in SDP

Prove that $X$ is PSD $\iff$ the principal submatrix of $X$ with all maximally linearly independent columns (and corresponding rows) left is PD.

Can we rewrite $\prod \frac{e^{y_i}}{y_i}$ in any way?

What are mathematicians talking about when using the term programming?

Trending Questions

Popular # Hahtags

Popular Questions