NEOS Server Home

NEOS Interfaces to penbmi

WWW Form & Sample Submissions
Email
XML-RPC

penbmi

The NEOS Server offers PENBMI for the solution of linear and bilinear matrix inequality problems.

More information on PENBMI is available in this user's guide. The code can be obtained from PenOpt GbR.

The algorithm used combines ideas of the exterior (penalty) and interior (barrier) methods with the Augmented Lagrangian method.
It can be called from a C/C++ program, a Fortran program, or from Matlab as in this implementation.

PENBMI was developed by Michal Kocvara and Michael Stingl.

This solver was implemented by Hans Mittelmann and executes at


Using the NEOS Server for PENBMI

The user must submit a BMI problem as a Matlab structure, as an ASCII file as in the Sample Submission problems, as a locally generated structure "pen", or as YALMIP m-files. See, the user's guide.

Here are two examples of structures in binary form: small case, large case,

Here is an m-file to generate random BMI instances.


Web Submission Form
PENBMI m-file
Enter the complete path to the PENBMI m-file
PENBMI structure(local file)
Alternatively, enter the complete path to the structure "pen" in Matlab binary format
YALMIP m-file(local file)
Alternatively, enter the complete path to a file in YALMIP format
YALMIP m-files zipped (not in a folder) as bmisolver.zip with driver bmisolver.m and then uuencoded/winzipped as bmisolver.uue(local file)
Alternatively, enter the complete path to a uuencoded zip file in YALMIP format
Comments
Additional Settings
Dry run: generate job XML instead of submitting it to NEOS
Short Priority: submit to higher priority queue with maximum CPU time of 5 minutes
E-Mail address:
Please do not click the 'Submit to NEOS' button more than once.