Closed lvjonok closed 1 month ago
Even simpler case could be the following:
import jax.numpy as np
from qpax import solve_qp
P = np.array([5.0])
q = np.array([-5.0])
A = np.zeros((0, 1))
b = np.zeros((0,))
G = np.zeros((0, 1))
h = np.zeros((0,))
# Solving the QP
x = solve_qp(P, q, A, b, G, h)[0]
# Check that answer is not nan
assert not np.isnan(x).any(), "Solution contains NaN values, expected [1.0]"
print(x)
Same issue as https://github.com/kevin-tracy/qpax/issues/6
Hello! I face problem solving QP without constraints at all.
Here is the script to reproduce: