Detecting rigid convexity of bivariate polynomials

DOI10.1016/j.laa.2009.10.033zbMath1183.65023arXiv0801.3592OpenAlexW1982678715MaRDI QIDQ847211

Didier Henrion

Publication date: 12 February 2010

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

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

zbMATH Keywords

linear matrix inequalitymultivariate polynomialsreal algebraic geometrysymbolic-numerical algorithmdetecting rigid convexity

Mathematics Subject Classification ID

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

Related Items (15)

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

Uses Software

• LFR-toolbox
• MULTIRES
• PolyX

Cites Work

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

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