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

QP Solver with extra terms and more variables #6

Closed
Benjiou opened this issue Feb 1, 2019 · 1 comment
Closed

QP Solver with extra terms and more variables #6

Benjiou opened this issue Feb 1, 2019 · 1 comment

Comments

@Benjiou
Copy link

Benjiou commented Feb 1, 2019

Hi @bamos ,

Thank you for this promising work and clean code if you don't mind.

I have some questions related to the solver.

Is it possible to :

  1. Add extra terms in the objective function and variable constraints ?
    https://github.com/locuslab/qpth/blob/master/qpth/qp.py#L36

A) extra terms in the objective function

\hat z = argmin_z 1/2 z^T Q z + p^T z+......+....+......

B) Add more variables constraints : for instance add y_, F_, K_, n_ to Q_, p_, G_, h_, A_, b_

  1. Is this constraint solver can deal with maximum solution rather than minimum ?

\hat z = argmax_z 1/2 z^T Q z + p^T z+......+....+......

Thank you a lot for your answer

@Benjiou Benjiou changed the title QPSolvers with extra terms and more variable QP Solvers with extra terms and more variable Feb 1, 2019
@Benjiou Benjiou changed the title QP Solvers with extra terms and more variable QP Solver with extra terms and more variable Feb 1, 2019
@Benjiou Benjiou changed the title QP Solver with extra terms and more variable QP Solver with extra terms and more variables Feb 1, 2019
@bamos
Copy link
Member

bamos commented Feb 1, 2019

Hi @Benjiou - just a quick response here, let me know if there's anything else!

  1. if extra terms in the objective still make your problem a QP it's probably the easiest (although not necessarily the most efficient) to re-formulate your problem so that it's in standard form. It may be more efficient to implement a solver for your problem

  2. You should be able to do this with \hat z = argmax f(z) = argmin -f(z)

@bamos bamos closed this as completed Feb 1, 2019
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

2 participants