Subject: CGAL users discussion list
List archive
- From: updog <>
- To:
- Subject: [cgal-discuss] A question about choosing internal type for QP solver.
- Date: Wed, 17 Aug 2011 07:26:38 -0700 (PDT)
The situation is that I don't need exactly precise solutions, but the
efficiency is critical since there are millions of very small QP (about 3~5
variables, 4~6 constrains) to solve. Any hints for that, please?
Does CGAL::solve_quadratic_program(qp, double())
have better efficiency than
CGAL::solve_quadratic_program(qp, ET())?
--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/A-question-about-choosing-internal-type-for-QP-solver-tp3750109p3750109.html
Sent from the cgal-discuss mailing list archive at Nabble.com.
- [cgal-discuss] A question about choosing internal type for QP solver., updog, 08/17/2011
Archive powered by MHonArc 2.6.16.