tag:crantastic.org,2005:/packages/sdpt3rLatest activity for sdpt3r2019-02-11T09:03:02Zcrantastic.orgtag:crantastic.org,2005:TimelineEvent/846722019-02-11T09:03:02Z2019-02-11T09:03:02Zsdpt3r was upgraded to version 0.3<a href="/packages/sdpt3r">sdpt3r</a> was <span class="action">upgraded</span> to version <a href="/packages/sdpt3r/versions/80492">0.3</a><br /><h3>Package description:</h3><p>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>.</p>crantastic.orgtag:crantastic.org,2005:TimelineEvent/806032018-10-18T12:42:40Z2018-10-18T12:42:40Zsdpt3r was upgraded to version 0.2<a href="/packages/sdpt3r">sdpt3r</a> was <span class="action">upgraded</span> to version <a href="/packages/sdpt3r/versions/76910">0.2</a><br /><h3>Package description:</h3><p>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>.</p>crantastic.orgtag:crantastic.org,2005:TimelineEvent/661032017-09-04T13:02:00Z2017-09-04T13:02:00Zsdpt3r was released<a href="/packages/sdpt3r">sdpt3r</a> was <span class="action">released</span><br /><h3>Package description:</h3><p>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>.</p>crantastic.org