Provides bindings to the 'OSQP' solver. The 'OSQP' solver is a numerical optimization package or solving convex quadratic programs written in 'C' and based on the alternating direction method of multipliers, 'ADMM'. B. Stellato, G. Banjac, P. Goulart, A. Bemporad, S. Boyd (2018)

Provides R-bindings to OSQP: the Operator Splitting QP Solver.

The OSQP (Operator Splitting Quadratic Program) solver is a numerical optimization package for solving problems in the form

```
minimize 0.5 x' P x + q' x
subject to l <= A x <= u
```

where `x in R^n`

is the optimization variable. The objective function is
defined by a positive semidefinite matrix `P in S^n_+`

and vector
`q in R^n`

. The linear constraints are defined by matrix
`A in R^{m x n}`

and vectors `l in R^m U {-inf}^m`

,
`u in R^m U {+inf}^m`

.

The interface is documented here.

- Updated OSQP to version 0.4.1

- Updated OSQP version

- First release on CRAN with new name