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

QPTDualize with non-singular Hessian #13

Open
jkruzik opened this issue Apr 24, 2020 · 2 comments · May be fixed by #20
Open

QPTDualize with non-singular Hessian #13

jkruzik opened this issue Apr 24, 2020 · 2 comments · May be fixed by #20
Assignees

Comments

@jkruzik
Copy link
Member

jkruzik commented Apr 24, 2020

  1. if QP does not have a nullspace matrix QPTDualize will try to compute one with MUMPS
  2. if empty nullspace matrix is attached/computed by QPTDualize the dual problem has an empty (unnecessary) linear equality constraint

cc: @haplav @lukaspospisil

@haplav
Copy link
Collaborator

haplav commented Apr 28, 2020

OK, I think I will be able to solve this.

@haplav
Copy link
Collaborator

haplav commented Apr 28, 2020

@jkruzik I feel like this should be solved first, together with an example, so that we are confident this works OK. Then having only inequality linear constraints, like in #12, is another level.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Development

Successfully merging a pull request may close this issue.

2 participants