Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

JGO
2008

favoriteEmaildiscussreport

83views more JGO 2008»

Global minimization of rational functions and the nearest GCDs

13 years 11 months ago

Global minimization of rational functions and the nearest GCDs

Download math.ucsd.edu

This paper discusses the global minimization of rational functions with or without constraints. We studied the sum of squares (SOS) relaxations and their properties to solve this kind of problem. Some special features are studied. As an application, we show how to find the nearest common divisors of polynomials via global minimization of rational functions.

Jiawang Nie, James Demmel, Ming Gu

Real-time Traffic

Global Minimization | JGO 2008 | Nearest Common Divisors | Rational Functions |

claim paper

Related Content

» Approximate GCDs of polynomials and sparse SOS relaxations

» Minimizing the sum of many rational functions

» Error Bounds for Lanczos Approximations of Rational Functions of Matrices

» An Evolutionary Approach for Molecular Docking

» Cost of Cooperation for Scheduling Meetings

» Semidefinite programming for NPlayer Games

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JGO
Authors	Jiawang Nie, James Demmel, Ming Gu

Comments (0)