导航 IntroductionBig-M reformulationNonconvex Polytope constraintsConvex HullsQ&AReferences Introduction YALMIP has some support for logic programming and structured nonconvex programming. This feature relies on converting the user supplied model to an…
导航 Determinant maximizationQ&AReferences Determinant maximization
给定两个椭球,求解行列式最大化问题 E 1 { x ∣ x T P 1 x ≤ 1 } E 2 { x ∣ x T P 2 x ≤ 1 } E_1\{x\mid x^TP_1x\leq 1\}\\ E_2\{x\mid x^TP_2x\leq 1\} E1{x∣xTP1x≤1}E2…