TY - GEN A1 - Neun, Winfried A1 - Sturm, Thomas A1 - Vigerske, Stefan T1 - Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests N2 - 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. T3 - ZIB-Report - 10-01 KW - Nonlinear Global Optimization KW - Hybrid Symbolic-Numeric Computation KW - Convex Functions KW - Real Quantifier Elimination Y1 - 2010 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-11644 SN - 1438-0064 ER -