Skip to content

Commit

Permalink
merge
Browse files Browse the repository at this point in the history
  • Loading branch information
enzbus committed Jun 30, 2024
2 parents 8f4f3a8 + e9f52b5 commit 419c8bb
Showing 1 changed file with 10 additions and 7 deletions.
17 changes: 10 additions & 7 deletions README.rst
Original file line number Diff line number Diff line change
Expand Up @@ -171,21 +171,24 @@ We will provide a CVXPY and raw Python interface as part of our packages. The
single C function the user interacts with will be also documented, for usage
from other runtime environments. In fact, our preview interface already works,
and that's what we're using in our testsuite. If you installed as described
above you can use the solver on *simple* LPs like this. From our tests you
should already observe higher numerical accuracy on the solution than with any
other solver.
above you can already test the solver on linear programs of moderate size,
we're testing so far up to a 2 or 3 hundreds variables. From our tests you
should already observe higher numerical accuracy on the constraints,
which are smaller or close to the machine precision of double arithmetics (2.2e-16),
and/or lower objective value on the solution, than with any other numerical solver

.. code-block:: python
import numpy as np
import cvxpy as cp
from project_euromir import Solver
A = np.random.randn(20, 10)
b = np.random.randn(20)
x = cp.Variable(10)
m, n = 100, 50
A = np.random.randn(m, n)
b = np.random.randn(m)
x = cp.Variable(n)
objective = cp.Minimize(cp.norm1(A @ x - b))
constraints = [cp.abs(x) <= .25]
constraints = [cp.abs(x) <= .05]
cp.Problem(objective, constraints).solve(solver=Solver())

0 comments on commit 419c8bb

Please sign in to comment.