Question

Maximizing linear objective over spectraplex

score 106 · Answer 1 · 2022-02-20 22:32:07

106

Views

Maximizing linear objective over spectraplex

Published on 20 Feb 2022 - 22:32

score 44 · Answer 2 · 2022-02-22 10:47:21

44

Views

Characterization of matrices with same column spaces

Published on 22 Feb 2022 - 10:47

score 118 · Answer 3 · 2022-03-21 14:25:39

118

Views

Minimize a convex function subject to concave quadratic constraints

Published on 21 Mar 2022 - 14:25

score 71 · Answer 4 · 2022-03-31 20:27:20

71

Views

Is there any hint how to prove this?

Published on 31 Mar 2022 - 20:27

score 148 · Answer 5 · 2022-04-08 22:34:11

148

Views

SDP problem with Schur complement-like constraint

Published on 08 Apr 2022 - 22:34

score 106 · Answer 6 · 2026-03-25 18:51:08

106

Views

How do you convert the following optimization problem with LMI constraints from the standard form given to the Semi Definite Programming(SDP) form?

Published on 25 Mar 2026 - 18:51

score 52 · Answer 7 · 2022-04-22 20:35:16

52

Views

Eigenvalue of PSD matrices by constrained SDP program

Published on 22 Apr 2022 - 20:35

score 306 · Answer 8 · 2022-04-24 15:01:16

306

Views

How does barrier function method for semidefinite programming avoid the case when even eigenvalues are negative?

Published on 24 Apr 2022 - 15:01

score 28 · Answer 9 · 2022-04-28 22:35:00

28

Views

Image of a $3 \times 3$ PSD cone under a linear transformation

Published on 28 Apr 2022 - 22:35

score 65 · Answer 10 · 2022-06-04 18:59:06

65

Views

Proving the sum of inner products between $N$ points ($N$ even) on the $k$-dimensional sphere $S^{k-1}$ is greater than or equal to $-N/2$

Published on 04 Jun 2022 - 18:59

score 120 · Answer 11 · 2026-02-23 03:25:52

120

Views

What algorithm does cvxpy actually use to solve SDP problems with the constraint form $\sum_i E_iXE_i^T \succ B$

Published on 23 Feb 2026 - 3:25

score 30 · Answer 12 · 2022-06-14 13:34:50

30

Views

Problems that semidefinit program(SDP) can solve while convex optimization cannot?

Published on 14 Jun 2022 - 13:34

score 19 · Answer 13 · 2026-03-23 23:22:29

19

Views

What are data matrices of a SDP problem?

Published on 23 Mar 2026 - 23:22

score 64 · Answer 14 · 2026-03-25 19:10:14

64

Views

Conversion of SDP relaxation of Travelling Salesman Problem (TSP) to standard SDP form

Published on 25 Mar 2026 - 19:10

score 83 · Answer 15 · 2022-06-29 01:10:51

83

Views

Rewriting quadratic optimization problem with negative definite matrix

Published on 29 Jun 2022 - 1:10

List Question

Maximizing linear objective over spectraplex

Characterization of matrices with same column spaces

Minimize a convex function subject to concave quadratic constraints

Is there any hint how to prove this?

SDP problem with Schur complement-like constraint

How do you convert the following optimization problem with LMI constraints from the standard form given to the Semi Definite Programming(SDP) form?

Eigenvalue of PSD matrices by constrained SDP program

How does barrier function method for semidefinite programming avoid the case when even eigenvalues are negative?

Image of a $3 \times 3$ PSD cone under a linear transformation

Proving the sum of inner products between $N$ points ($N$ even) on the $k$-dimensional sphere $S^{k-1}$ is greater than or equal to $-N/2$

What algorithm does cvxpy actually use to solve SDP problems with the constraint form $\sum_i E_iXE_i^T \succ B$

Problems that semidefinit program(SDP) can solve while convex optimization cannot?

What are data matrices of a SDP problem?

Conversion of SDP relaxation of Travelling Salesman Problem (TSP) to standard SDP form

Rewriting quadratic optimization problem with negative definite matrix

Trending Questions

Popular # Hahtags

Popular Questions