<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body text="#000000" bgcolor="#FFFFFF">
Google has their QP solver they use in Maps and StreetView available
on Google Code. <br>
<br>
Damien<br>
<br>
<div class="moz-cite-prefix">On 07/02/2013 7:58 AM, Antonello
Lobianco wrote:<br>
</div>
<blockquote
cite="mid:CAOibvJEWJB5TtJ0fy9T38nMqGNvVACMVS-ca0_=mpDXX8qVkvQ@mail.gmail.com"
type="cite">Hello.. I use normally ipopt but for a project I need
a solver for a Quadratic Problem (so I don't need to pass all the
extra-information for general nonlinear programming.. hessian,
jacobian..)<br>
<br>
For LP I use GLPK, but I am now lost on what to use for QP..
within the COIN-OR projects I can see Clp, but from the manual I
got that QP is not at his core...<br>
Then I found JOptimizer, but again I have no idea of the
performances nor how it will be easy to link a java program from a
C++ program (I never used Java)..<br>
<br>
Any suggestions? I would prefer to find an open source fast QP
solver working on Linux/Win (MinGW).<br>
Thank you...<br clear="all">
<br>
-- <br>
Antonello Lobianco<br>
INRA, Laboratoire d'Economie Forestière<br>
14 Rue Girardet - 54000 Nancy, France<br>
Tel: +33.652392310<br>
Email: <a moz-do-not-send="true"
href="mailto:antonello.lobianco@nancy-engref.inra.fr"
target="_blank">antonello.lobianco@nancy-engref.inra.fr</a><br>
<a moz-do-not-send="true" href="http://antonello.lobianco.org/"
target="_blank">http://antonello.lobianco.org</a>
<br>
<fieldset class="mimeAttachmentHeader"></fieldset>
<br>
<pre wrap="">_______________________________________________
Ipopt mailing list
<a class="moz-txt-link-abbreviated" href="mailto:Ipopt@list.coin-or.org">Ipopt@list.coin-or.org</a>
<a class="moz-txt-link-freetext" href="http://list.coin-or.org/mailman/listinfo/ipopt">http://list.coin-or.org/mailman/listinfo/ipopt</a>
</pre>
</blockquote>
<br>
</body>
</html>