min{(C1,X1) + ... + (CN,XN): A1(X1) + ... + AN(XN) = b, X1,...,XN psd} max{(b,y) : A1t(y) + Z1 = C1,...,ANt(y) + ZN = CN, Z1,..,ZN psd} where Xk, Zk are either symmetric positive semidefinite matrices or non-negative vectors.Important note: this is a research software. It is not intended nor designed to be a general purpose software at the moment. The solver is expected to be robust if the primal and dual SDPs are both non-degenerate at the optimal solutions. However, if either of one of them is degenerate, then the solver may not be able to solve the SDPs accurately.

This software package is designed for solving standard SDP problems with max{n1,...,nN} (nk=dimension of matrix variable Xk) up to 2000. The number of linear equality constraints (dimension of b) can be large. In our numerical experiments, we have successfully solved SDPs with m > 1 million.

For more details, see:

- Copyright: This version of SDPNAL is distributed under the GNU General Public License 2.0. For commercial applications that may be incompatible with this license, please contact the authors to discuss alternatives.
- User guide: in preparation. SDPNAL is designed with the same data structure as in SDPT3, thus if you are familiar with SDPT3, then you can code the SDP data of your problem as you would for SDPT3.
**SDPNAL-0.1.zip**

Please read. Welcome to SDPNAL! The software requires a few Mex files for execution. You can generate (only need to be done once) these Mex files as follows:- Firstly, unpack the software:

unzip SDPNAL-0.1.zip - Run Matlab in the directory SDPNAL-0.1
- In the Matlab command window, type:

>> Installmex

- After that, to see whether you have installed SDPNAL-0.1 correctly,
type:

>> startup

>> sdpnaldemo - By now, SDPNAL is ready for you to use.

- Firstly, unpack the software: