-
Notifications
You must be signed in to change notification settings - Fork 121
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Support for det(P)^(1/n) #214
Comments
An example of implementation can be found in mosek source code in |
There was an old issue which may be of interest: #132 |
@blegat , thank you for pointing me toward the mosek implementation. Using the references mentioned in the source code, I was able to put together my own implementation. |
Now that #590 is merged, this issue can be resolved by adding a |
In trying to solve a problem with objective function
maximize det(P)
there are two common transformations that turn the objective into a convex objective.
The first is to convert the problem to
maximize logdet(P)
which is currently implemented and can be solved using e.g. SCS.
Another option is to instead solve
maximize det(P)^(1/n)
This is equivalent to the geometric mean of the eigenvalues of
P
. From what I've read, this can be modeled with semidefinite and second order cones (I don't know the details of this). This allows a lot more solvers to be used to solve this optimization problem (instead of relying on a first order method like SCS)Would it be possible to get support for the nth root of the determinant added?
The text was updated successfully, but these errors were encountered: