Segmentation fault on a sparse problem about proxsuite HOT 5 CLOSED

Thanks for raising the issue @stephane-caron.
It is due to the empty A and b. So I will fix the issue #6 which causes it.

import numpy as np
import proxsuite
import scipy.sparse as spa

n = 150
M = spa.lil_matrix(spa.eye(n))
for i in range(1, n - 1):
    M[i, i + 1] = -1
    M[i, i - 1] = 1

H = spa.csc_matrix(M.dot(M.transpose()))
g = -np.ones((n,))
A = np.zeros((0,n))
b = np.zeros(0)
C = spa.csc_matrix(spa.eye(n))
l = 2.0 * np.ones((n,))
u = np.full(l.shape, +np.infty)

results = proxsuite.proxqp.sparse.solve(H, g, A, b, C, u, l)

works fine for both dense and sparse backend (considering the exact solution you mention).

from proxsuite.

Confirmed! Both sparse and dense solvers return the correct solution when A and b are np.zeros.

from proxsuite.

@Bambade could you check in C++ and fix it?

from proxsuite.

Could you check in debug mode?

from proxsuite.

@stephane-caron thanks for raising this issue. Could you confirm that this works with the dense solver?

from proxsuite.