Solves convex cone programs via operator splitting. Can solve: linear programs (LPs), second-order cone programs (SOCPs), semidefinite programs (SDPs), exponential cone programs (ECPs), and power cone programs (PCPs), or problems with any combination of those cones. SCS uses AMD (a set of routines for permuting sparse matrices prior to factorization) and LDL (a sparse LDL' factorization and solve package) from 'SuiteSparse' (<http://www.suitesparse.com>).
|Author||Florian Schwendinger [ctb, cre], Brendan O'Donoghue [aut, cph], Timothy A. Davis [cph], Patrick R. Amestory [cph], Iain S. Duff [cph]|
|Date of publication||2016-02-23 22:28:01|
|Maintainer||Florian Schwendinger <FlorianSchwendinger@gmx.at>|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.