- #1
Kaushal821
- 1
- 0
- TL;DR Summary
- Actually I am trying to generate a code for positive semidefinite programming, I have a block symmetric matrix of 256 elements (16x16) and I want to solve an equation using this, which looks like A - tX >=0 where A is known, t is a scalar variable and X is diagonal block matrix variable. So Ideally I have to optimize both t and X.
For this problem I am using 'cvxpy' library and using a set of constraints to optimize the value of t and X.