Detecting rigid convexity of bivariate polynomials

DOI10.1016/J.LAA.2009.10.033zbMATH Open1183.65023arXiv0801.3592OpenAlexW1982678715MaRDI QIDQ847211FDOQ847211

Authors: Didier Henrion 

Publication date: 12 February 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: Given a polynomial $xin{mathbbR}^{n}mapstop(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set $mathcalP=x:p(x)geq0$ containing the origin is rigidly convex, or equivalently, whether it has a linear matrix inequality (LMI) representation, or equivalently, if polynomial $p(x)$ is hyperbolic with respect to the origin. The problem boils down to checking whether a univariate polynomial matrix is positive semidefinite, an optimization problem that can be solved with eigenvalue decomposition. When the variety $mathcalC=x:p(x)=0$ is an algebraic curve of genus zero, a second algorithm based on B'ezoutians is proposed to detect whether $mathcalP$ has an LMI representation and to build such a representation from a rational parametrization of $mathcalC$. Finally, some extensions to positive genus curves and to the case $n>2$ are mentioned.

Full work available at URL: https://arxiv.org/abs/0801.3592

Recommendations

• Obstructions to determinantal representability
• Computing linear matrix representations of Helton-Vinnikov curves
• LMI representations of the convex hulls of quadratic basic semialgebraic sets
• Noncommutative polynomials describing convex sets
• Matrix inequalities: A symbolic procedure to determine convexity automatically

zbMATH Keywords

linear matrix inequalityreal algebraic geometrymultivariate polynomialssymbolic-numerical algorithmdetecting rigid convexity

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Semidefinite programming (90C22) Miscellaneous inequalities involving matrices (15A45) Computational aspects of algebraic curves (14Q05) Real polynomials: location of zeros (26C10)

Cites Work

• Title not available (Why is that?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Self-adjoint determinantal representations of real plane curves
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms in real algebraic geometry
• The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
• Rational parametrizations of algebraic curves using a canonical divisor
• Title not available (Why is that?)
• Determinantal hypersurfaces.
• Introduction to the solution of polynomial systems
• Hyperbolic programs, and their derivative relaxations
• Linear matrix inequality representation of sets
• Positive trigonometric polynomials and signal processing applications
• Title not available (Why is that?)
• How bad are Hankel matrices?
• Title not available (Why is that?)
• Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
• Noncommutative convexity arises from linear matrix inequalities
• New algorithms for polynomial \(J\)-spectral factorization
• Positivity and linear matrix inequalities
• On polynomial matrix spectral factorization by symmetric extraction
• Optimization Problems over Positive Pseudopolynomial Matrices
• The Lax conjecture is true
• Title not available (Why is that?)
• Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
• Determinantal representations of smooth cubic surfaces
• Linear symmetric determinantal hypersurfaces
• Convex sets with semidefinite representation
• Computing Riemann matrices of algebraic curves
• Symbolic parametrization of curves
• Title not available (Why is that?)
• On the discriminant function of two commuting nonselfadjoint operators
• Computing the Abel map
• Polynomial J-spectral factorization
• Efficient algorithm for matrix spectral factorization
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Toeplitz algorithm for polynomial \(J\)-spectral factorization

Cited In (15)

• Reduction of the \(c\)-numerical range to the classical numerical range
• Determinantal representations of closed orbits
• Determinantal representations of hyperbolic forms via weighted shift matrices
• Title not available (Why is that?)
• Determinantal representation of trigonometric polynomial curves via Sylvester method
• Construction of determinantal representation of trigonometric polynomials
• Reduction of joint \(c\)-numerical ranges
• Determinantal representations and the Hermite matrix
• Stable and real-zero polynomials in two variables
• Definite determinantal representations of multivariate polynomials
• Quartic curves and their bitangents
• Symmetric determinantal representation of polynomials
• Testing hyperbolicity of real polynomials
• Definite determinantal representations via orthostochastic matrices
• LMI Representations of Convex Semialgebraic Sets and Determinantal Representations of Algebraic Hypersurfaces: Past, Present, and Future

Uses Software

• LFR-toolbox
• MULTIRES
• PolyX

This page was built for publication: Detecting rigid convexity of bivariate polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847211)