[Coin-lpsolver] CLP: Question about current state of QP solving capabilities.

[Christian Kirches]

Dear COIN-OR developers,

I have browsed through CLP's documentation, FAQ, and example programs, 
and was left in doubt a bit about CLP's QP solving capabilities. On the 
one hand, the FAQ entry clearly states that QP solving using the 
interior-point code is in an early state of development only, but 
nonetheless usually more efficient that the quadratic simplex code. On 
the other hand, that FAQ entry dates back to 2004 and seemingly refers 
to a 0.9x version wheres I find 1.5.0 being the most recent revision.

I would be extremely grateful if you could elaborate on the current 
state of the two algorithms regarding the solution of convex / 
semidefinite QPs with a size of ~500 variables and ~1000 linear 
constraints ?

Best regards,
Christian Kirches

-- 
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
             Dipl.-Math. Christian Kirches

           Simulation and Optimization Group
Interdisciplinary Center for Scientific Computing (IWR)
        Ruprecht-Karls-University of Heidelberg

address: Im Neuenheimer Feld 368, D-69120 Heidelberg
e-mail:  christian.kirches at iwr.uni-heidelberg.de
phone:   +49 6221 54 8895    
room:    414
                         Private

address: Stahlbuehlring 143, D-68526 Ladenburg
e-mail:  christian.kirches at gmail.com
phone:   +49 6203 922 681
mobile:  +49 176 21 72 37 22
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~