Skip to main content
9 events
when toggle format what by license comment
Nov 28 at 15:06 history bumped CommunityBot This question has answers that may be good or bad; the system has marked it active so that they can be reviewed.
Nov 12 at 13:21 comment added Mark L. Stone Most solvers work in the real domain. However, a problem in the complex domain can be converted to real. Modeling fron ends to (convex optimization tools such as CVX, CVXPY, CVXR, Mosek and others accept problems in the complex domain and do the necessary conversion to real under the hood before calling the solver. These tools allow declaration of a matrix as hermitian, or hermitian semidefinite.
Nov 12 at 5:46 comment added zycai Hi Mark, if the problem is in the complex positive semidefinite Hermitian matrix domain, can these integer solvers still accept it? Thanks.
Oct 29 at 14:58 answer added Mark L. Stone timeline score: 0
Oct 29 at 3:56 comment added zycai Thanks. I will survey the above-mentioned solvers and see if there are further questions.
Oct 28 at 12:18 comment added Mark L. Stone This appears to be a binary Bilinear Matrix Inequality. The biliinear terms can be "linearized" because all product terms must be 0 or 1 Therefore, this can be converted to a binary Linear Semidefinite (Matrix Inequality) constraint. Presuming the objective is linear or convex quadratic, that can be (attempted to be) solved with a Mixed-Integer Linear SDP solver, such as SCIP-MISDP, or under YALMIP (using BNB + Mosek (or other Lineasr SDP solver), ,or cutsdp + MILP solver). Whether it can actually be solved within a time and memory budget is another matter.
Oct 27 at 15:22 history edited YCor CC BY-SA 4.0
removed capitals from title, added tag
S Oct 27 at 15:08 review First questions
Oct 27 at 15:14
S Oct 27 at 15:08 history asked zycai CC BY-SA 4.0