sdpt3r: Semi-Definite Quadratic Linear Programming Solver

Solves the general Semi-Definite Linear Programming formulation using an R implementation of SDPT3 (K.C. Toh, M.J. Todd, and R.H. Tutuncu (1999) <doi:10.1080/10556789908805762>). This includes problems such as the nearest correlation matrix problem (Higham (2002) <doi:10.1093/imanum/22.3.329>), D-optimal experimental design (Smith (1918) <doi:10.2307/2331929>), Distance Weighted Discrimination (Marron and Todd (2012) <doi:10.1198/016214507000001120>), as well as graph theory problems including the maximum cut problem. Technical details surrounding SDPT3 can be found in R.H Tutuncu, K.C. Toh, and M.J. Todd (2003) <doi:10.1007/s10107-002-0347-5>.

Package details

AuthorKim-Chuan Toh (Matlab/C), Micheal Todd (Matlab/C), Reha Tutunco (Matlab/C), Adam Rahman (R/C Headers), Timothy A. Davis (symamd C code), Stefan I. Larimore (symamd C code)
MaintainerAdam Rahman <[email protected]>
LicenseGPL-2 | GPL-3
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the sdpt3r package in your browser

Any scripts or data that you put into this service are public.

sdpt3r documentation built on Oct. 18, 2018, 5:05 p.m.