, Volume 40, Issue 4, pp 697-718
Date: 16 Dec 2006

Global minimization of rational functions and the nearest GCDs

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper discusses the global minimization of rational functions with or without constraints. We propose sum of squares relaxations to solve these problems, and study their properties. Some special features are discussed. First, we consider minimization of rational functions without constraints. Second, as an application, we show how to find the nearest common divisors of polynomials via unconstrained minimization of rational functions. Third, we discuss minimizing rational functions under some constraints which are described by polynomials.