Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests

Convexity is an important property in nonlinear optimization since it allows to apply efficient local methods for finding global solutions. We propose to apply symbolic methods to prove or disprove convexity of rational functions over a polyhedral domain. Our algorithms reduce convexity questions to real quantifier elimination problems. Our methods are implemented and publicly available in the open source computer algebra system Reduce. Our long term goal is to integrate Reduce as a “workhorse” for symbolic computations into a numerical solver.

• Type: Journal
• Year: 2010
• Where: CASC
• Authors: Winfried Neun, Thomas Sturm, Stefan Vigerske
• Keywords: CASC 2010, Convexity Questions, Efficient Local Methods, Mathematics, Quantifier Elimination Problems