Ask Your Question
0

possible to solve this optimizationproblem with LMI?

asked 2011-12-05 01:49:07 -0500

et gravatar image

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 12:41:20 -0500

Yes, semidefinite optimisation is available in Sage, check out

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

edit flag offensive delete link more

Your Answer

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

Add Answer

Question Tools

1 follower

Stats

Asked: 2011-12-05 01:49:07 -0500

Seen: 201 times

Last updated: Jan 29