|Mittagsseminar Talk Information|
Date and Time: Tuesday, June 12, 2007, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Bernd Gärtner
Exactly solving linear and quadratic programs in CGAL
Release 3.3 of CGAL, the Computational Geometry Algorithms library,
contains a solver for linear and convex quadratic programs. Originally
motivated by (and tuned for) applications in low-dimensional geometric
optimization, the solver is now also useful as a general-purpose tool
for medium-sized problems. The solution is computed in exact rational
arithmetic, and it comes with certificates that make it easy to verify
the correctness of the output.
After a brief advertisement of CGAL, its philosophy and its
functionality, I describe the (simplex-type) algorithm behind the
solver. Then I present a simple example of its usage. I conclude with
a few benchmarks and a discussion about when (and when not) it might
be beneficial for you to use the CGAL solver.
Joint work with Kaspar Fischer, Sven Schönherr, and Frans Wessendorp.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.3392 | admin login