SDPNAL+ version 1.0 -- a MATLAB software for semidefinite programming with bound constraints.
Authors: Defeng Sun, Kim-Chuan Toh, Yancheng Yuan, and Xinyuan Zhao.
Past contributors: Liuqin Yang.
Important note:
The current beta version is still under development. Thus it will invariably be buggy. We would appreciate your feedback and bugs' report to the corresponding author: Kim-Chuan Toh, email: mattohkc@nus.edu.sg.
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 to high accuracy.
This software package is designed for solving standard SDP problems with max{n1,...,nN}max{n1,...,nN} (nknk=dimension of matrix variable XkXk) up to 5000. The number of linear equality constraints (dimension of b) can be large. In our numerical experiments, we have successfully solved SDPs with m > 10 millions.
Detailed computational results (computed in Aug 2017) for over 500 problems tested in the following papers.
Authors: Defeng Sun, Kim-Chuan Toh, Yancheng Yuan, and Xinyuan Zhao.
Past contributors: Liuqin Yang.
Important note:
The current beta version is still under development. Thus it will invariably be buggy. We would appreciate your feedback and bugs' report to the corresponding author: Kim-Chuan Toh, email: mattohkc@nus.edu.sg.
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 to high accuracy.
This software package is designed for solving standard SDP problems with max{n1,...,nN}max{n1,...,nN} (nknk=dimension of matrix variable XkXk) up to 5000. The number of linear equality constraints (dimension of b) can be large. In our numerical experiments, we have successfully solved SDPs with m > 10 millions.
Detailed computational results (computed in Aug 2017) for over 500 problems tested in the following papers.
アクセス
トータル
