{"library":"proxsuite","title":"proxsuite","description":"The ProxSuite library provides an efficient QP solver tailored for robotics and optimization, with implementations of the ProxQP and OSQP algorithms. The current version is 0.7.2.post1, released under a permissive license. It supports Python >= 3.8 and has a bimonthly release cadence.","language":"python","status":"active","last_verified":"Fri May 01","install":{"commands":["pip install proxsuite"],"cli":null},"imports":["import proxsuite","from proxsuite import proxqp"],"auth":{"required":false,"env_vars":[]},"quickstart":{"code":"import proxsuite\nimport numpy as np\n\n# Solve a simple QP: min 0.5 x'Hx + g'x s.t. Cx <= d\nH = np.eye(2)\ng = np.array([-2, -3])\nC = np.array([[1, 2], [-1, 0]])\nd = np.array([4, 0])\n\n# Create solver and solve\nqp = proxsuite.proxqp.dense.QP(H, g, C, d)\nproxsuite.proxqp.dense.solve(qp)\nprint(qp.results.x)","lang":"python","description":"Minimal example solving a dense QP with inequality constraints.","tag":null,"tag_description":null,"last_tested":null,"results":[]},"compatibility":null}