0

possible to solve this optimizationproblem with LMI?

optimization

asked 2011-12-05 08:49:07 +0200

et
1 ●1

hello guys, i got a problem like this. find the maximum of det(X), X=[x11,x12;x21,x22]. with the constraint x11^2+x21^2<1 und x12^2+x22^2<1. I think the constraint is not linear and it's not possible to use LMI to solve the problem. but i have not learnt LMI before. so i'd like to ask your opinions first. thx

edit retag flag offensive close merge delete

1 Answer

Sort by » oldest newest most voted

0

answered 2019-01-29 19:41:20 +0200

Dima
716 ●8 ●22 https://github.com/dim...

Yes, semidefinite optimisation is available in Sage, check out

http://doc.sagemath.org/html/en/refer...

edit flag offensive delete link

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Question Tools

1 follower

Stats

Asked: 2011-12-05 08:49:07 +0200

Seen: 309 times

Last updated: Jan 29 '19

Related questions

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.

Powered by Askbot version 0.7.59