Commit bd999e39 authored by Gabriele Buondonno's avatar Gabriele Buondonno
Browse files

[README] Document different implementations

parent 25242f0d
......@@ -3,7 +3,7 @@
[![Pipeline status](https://gepgitlab.laas.fr/stack-of-tasks/eiquadprog/badges/master/pipeline.svg)](https://gepgitlab.laas.fr/stack-of-tasks/eiquadprog/commits/master)
[![Coverage report](https://gepgitlab.laas.fr/stack-of-tasks/eiquadprog/badges/master/coverage.svg?job=doc-coverage)](http://projects.laas.fr/gepetto/doc/stack-of-tasks/eiquadprog/master/coverage/)
This repo contains a C++ implementation of the algorithm of Goldfarb and Idnani for the solution of a (convex) Quadratic Programming problem by means of a dual method.
This repo contains different C++ implementations of the algorithm of Goldfarb and Idnani for the solution of a (convex) Quadratic Programming problem by means of a dual method.
The problem is in the form:
min 0.5 * x G x + g0 x
......@@ -11,6 +11,13 @@ The problem is in the form:
CE^T x + ce0 = 0
CI^T x + ci0 >= 0
There are 3 implementations:
- `eiquadprog.hpp`: the original C++ implementation
- `eiquadprog-fast.hpp`: an improved version employing a wrapper, avoiding dynamic memory allocation
- `eiquadprog-rt.hpp`: similar to the above, it employs fixed-size Eigen vectors. This requires the problem dimensions to be known at compile time and is recommended only for small problems.
Please refer to the unit tests for examples of usage.
## Authors
[Eiquadprog](https://github.com/stack-of-tasks/eiquadprog) was created at LAAS-CNRS by Gabriele Buondonno, based on
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment