Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-14T08:04:53.064Z Has data issue: false hasContentIssue false

Hyperbolic Polynomials and Convex Analysis

Published online by Cambridge University Press:  20 November 2018

Heinz H. Bauschke
Affiliation:
Department of Mathematics and Statistics Okanagan University College Kelowna, British Columbia V1V 1V7, email: bauschke@cecm.sfu.ca
Osman Güler
Affiliation:
Department of Mathematics and Statistics University of Maryland Baltimore County Baltimore, Maryland 21228, USA, email: guler@math.umbc.edu
Adrian S. Lewis
Affiliation:
Department of Combinatorics & Optimization University of Waterloo Waterloo, Ontario N2L 3G1, email: aslewis@math.uwaterloo.ca
Hristo S. Sendov
Affiliation:
Department of Combinatorics & Optimization University of Waterloo Waterloo, Ontario N2L 3G1, email: hssendov@barrow.uwaterloo.ca
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A homogeneous real polynomial $p$ is hyperbolic with respect to a given vector $d$ if the univariate polynomial $t\,\mapsto \,p(x\,-\,td)$ has all real roots for all vectors $x$ . Motivated by partial differential equations, Gårding proved in 1951 that the largest such root is a convex function of $x$ , and showed various ways of constructing new hyperbolic polynomials. We present a powerful new such construction, and use it to generalize Gårding’s result to arbitrary symmetric functions of the roots. Many classical and recent inequalities follow easily. We develop various convex-analytic tools for such symmetric functions, of interest in interior-point methods for optimization problems over related cones.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2001