Ask Your Question

LMI (Linear Matrix Inequalities)

asked 2010-11-09 10:50:13 -0600

SUavcho gravatar image

updated 2015-01-13 15:51:45 -0600

FrédéricC gravatar image


I installed SAGE and I was very happy with the results it gave in the very beginning.

However, the reason I installed it was because I need an open-source alternative for solving Linear matrix inequalities (LMIs). I did not find an LMI solver in SAGE, though.

I will be very delighted if you help me with this issue.

Please let me know if you want more information on the problems I want to solve.

Yours faithfully,

Slavi Slavchev, PA (Professor Assistant) Sofia University 'St Kliment Ohridski', Bulgaria

edit retag flag offensive close merge delete


Can you give a short example of what an LMI is and what the solution would be?

Jason Grout gravatar imageJason Grout ( 2010-11-09 16:47:47 -0600 )edit

4 answers

Sort by » oldest newest most voted

answered 2010-11-14 19:33:45 -0600

Nathann gravatar image

To me, your Linear Matrix Inequalities really sound like Linear Programming... And if it actually is linear programming, you may be glad to learn that GLPK, Coin, and CPLEX can be used through Sage to solve LP (GLPK being installed as a standard package).

Here is an introduction to LP using Sage

Here is the documentation page for the MixedIntegerLinearProgram class (your second best friend when dealing with LP)


edit flag offensive delete link more

answered 2010-11-10 16:15:25 -0600

kcrisman gravatar image

updated 2010-11-10 16:20:11 -0600

I think this is an OR/LP/optimization concept you want, right? Sage includes interfaces to several such programs, including CPLEX (though I don't know how comprehensive it is), and has cvxopt as a standard package. See for instance the cvxopt documentation for more details about convex optimization, which says the following:

The linear inequality is a generalized inequality with respect to a proper convex cone. It may include componentwise vector inequalities, second-order cone inequalities, and linear matrix inequalities.

So hopefully that would be a good option. More info about the Sage interface is here.

Scipy is also included, and may have some of what you are looking for, as may GLPK, which may not yet be standard (I can't recall, though it's been discussed recently). In addition, we'd welcome additional help integrating the resources these programs bring to Sage, if you find you are interested in this!

edit flag offensive delete link more

answered 2013-12-23 16:00:09 -0600

Behzad gravatar image

It might be too late but you here is CVXOPT, the solver for convex optimization:

edit flag offensive delete link more

answered 2010-12-06 14:27:36 -0600

SUavcho gravatar image

Actually, this is what I want to do:

I checked the materials you supplied, but I'm afraid they won't help much. Any other ideas?

Thank you in advance!

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


Asked: 2010-11-09 10:50:13 -0600

Seen: 642 times

Last updated: Dec 23 '13