c( person("Florian", "Schwendinger", role = c("aut", "cre"), email = "FlorianSchwendinger@gmx.at"),
              person("Brendan", "O'Donoghue", role = c("aut", "cph")),
              person("Balasubramanian", "Narasimhan", role = c("aut")),
              person("Timothy A.", "Davis", role = "cph"),
              person("Patrick R.", "Amestory", role = "cph"),
              person("Iain S.", "Duff", role = "cph"))
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' (<https://people.engr.tamu.edu/davis/suitesparse.html>).
Florian Schwendinger [aut, cre],
  Brendan O'Donoghue [aut, cph],
  Balasubramanian Narasimhan [aut],
  Timothy A. Davis [cph],
  Patrick R. Amestory [cph],
  Iain S. Duff [cph]