Skip to first unread message
Asad
Oct 8, 2014, 5:56:17 AM10/8/14
to yal...@googlegroups.com
I want to solve a SOS program and find lyapunov like certificates for sets which are additionally constrained by "Mixed Integer Linear Constraints". Is it possible in Yalmip? Any other idea like "Mixed Integer Semidefinite programming"?
Johan Löfberg
Oct 8, 2014, 5:57:53 AM10/8/14
to yal...@googlegroups.com
Yes, there can be integrality constraints in SOS models. The resulting MISDP problems will be (tried to be) solved by YALMIP b&b solver bnb.
Reply all
Reply to author
Forward
0 new messages