Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

sparse/solver: use refactorize for matrix free solver #73

Merged

Conversation

fabinsch
Copy link
Collaborator

proposed by @Bambade , necessary to solve large sparse problems like the HUESTIS problem from maros meszaros.

@fabinsch fabinsch changed the title sparse/solver: use refactorizefor matrix free solver sparse/solver: use refactorize for matrix free solver Oct 31, 2022
@jcarpent jcarpent merged commit 610d099 into Simple-Robotics:devel Oct 31, 2022
stephane-caron added a commit to qpsolvers/qpbenchmark that referenced this pull request Nov 8, 2022
Note on this assertion on that of previous commits: the main thing is
that ProxQP 0.2.5 solves 30 more problems than 0.2.2, mostly thanks to
Simple-Robotics/proxsuite#73. These assertions
are on the overall performance over the whole test set, which improved
because on those 30 problems the worst performance was previously
assumed (maximum runtime, maximum errors).
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants