does proxqp optimize the case when objective matrix(H) is dense but inequality constraint matrix(C) is very sparse,

[pengfzhou]

[pengfzhou]

also can proxqp deal with simple box bound efficiently if a problem only have box constraint

[jcarpent]

If H is dense, it is thus better to use the dense backend. The sparse backend is still under development.
What is the size of your problems? Could you share an example?

also can proxqp deal with simple box bound efficiently if a problem only have box constraint

We can handle bound constraints as generic inequality constraints. Shortly, we will add explicit support for bound constraints for efficiency reasons.

[jcarpent]

Related to #47