location:  Publications → journals
Search results

Search: MSC category 90C25 ( Convex programming )

 Expand all        Collapse all Results 1 - 1 of 1

1. CJM 2001 (vol 53 pp. 470)

Bauschke, Heinz H.; Güler, Osman; Lewis, Adrian S.; Sendov, Hristo S.
 Hyperbolic Polynomials and Convex Analysis A homogeneous real polynomial $p$ is {\em 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{\aa}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{\aa}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. Keywords:convex analysis, eigenvalue, G{\aa}rding's inequality, hyperbolic barrier function, hyperbolic polynomial, hyperbolicity cone, interior-point method, semidefinite program, singular value, symmetric functionCategories:90C25, 15A45, 52A41
 top of page | contact us | privacy | site map |