Determinant maximizationLet us solve a determinant maximization problem. Given two ellipsoids
Find the ellipsoid E = {x | xTPx≤1} with smallest possible volume that contain the union of E1 and E2. By using the fact that the volume of the ellipsoid is proportional to -det P and applying the S-procedure, it can be shown that this problem can be written as The objective function -det P (which is minimized) is not convex, but monotonic transformations can render this problem convex. One alternative is the logarithmic transform, leading to minimization of -log det P instead. This operator was used in previous version of YALMIP, but is not recommended any more. Instead, YALMIP uses -(det P)1/m where m is dimension of P (in other words, the geometric mean of the eigenvalues). The concave function (det P)1/m, available by applying geomean on a Hermitian matrix in YALMIP, can be modeled using semidefinite and second order cones, hence any SDP solver can be used for solving determinant maximization problems. See [Nesterov and Nemirovskii] for details.
If you have the dedicated solver MAXDET installed and want to use it, you must use the dedicated command logdet for the objective and explicitly select MAXDET. This command can not be used in any other construction than in the objective function, compared to the geomean operator that can be used as any other variable in YALMIP, since it a so called extended operator.
|