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

Linear programming question #173

Closed
antonvorobets opened this issue Jan 27, 2023 · 3 comments
Closed

Linear programming question #173

antonvorobets opened this issue Jan 27, 2023 · 3 comments
Assignees

Comments

@antonvorobets
Copy link

antonvorobets commented Jan 27, 2023

In the README, you write about LPs and QPs. As far as I understand, you currently only have a QP interface, but it can of course also be used for solving LPs by letting P be a matrix of zeros. Is this how you intend to solve LPs, or are you planning on making an LP interface?

I am quite impressed with your QP solver so far. It also seems to have good performance on LPs, but it might be possible to improve further if it has its own interface.

@jcarpent
Copy link
Member

Dear @antonvorobets,

Thanks for your interesting feedback and your interest in ProxSuite. This is indeed planned to add this feature to the library to be highly efficient on LPs by not considering any Hessian.
Our main concern is the lack of time and resources we can allocate to this task, as we have other directions for the roadmap. Do you have resources on your side to allocate to this LP feature?

Best,
Justin

@antonvorobets
Copy link
Author

I would love to help with what I can, but I am afraid that my c++ and understanding of primal-dual proximal algorithms is too limited at this point.

If you can make a to-do list, I can consider if there are tasks where I or others that I know can help in the short term.

@jcarpent
Copy link
Member

Solved via #231.

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

No branches or pull requests

3 participants