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

Abstract

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… (More)
DOI: 10.1007/978-3-642-15274-0_19

1 Figure or Table

Topics

  • Presentations referencing similar topics