-
Notifications
You must be signed in to change notification settings - Fork 6
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
A feasible QP problem can not be solved after other QPs had been solved. #6
Comments
@dkouzoup wrote:
If I remove all calls to In this case, the same error occurs. |
Hi, I had a brief look at your example.
|
Hello @jfrasch , Thank you for your suggestions about the line search option. I think it would be a good idea to check that the linear search option is consistent with the Hessian type or to set this option automatically based on Hessian type. I am trying to use qpDUNES in a real application. My example reproduces exactly the sequence of calls that happens in the application, therefore I cannot base it on a 'working example'. I tried to keep the call sequence consistent with the working examples though. If you think I am using the qpDUNES API in a wrong way, please tell me where. |
@mkotlyar Let me know if you need help. I have managed to use qpDUNES in a real application -- at least to hook it up to the app software. |
To reproduce, run the example code in the
issue6
branch, `examples/test_issue_6.c'. The output is:The same QP problem can be solved with
MATLAB quadprog
(seeexamples/issue6_test.m
).The appearance of this issue seems to depend on the pre-history of solver calls. If the same QP is the very first one after
qpDUNES_setup()
, it is solved successfully. To check it, uncomment#define SKIP
on line 4 inexamples/test_issue_6.c
.The text was updated successfully, but these errors were encountered: