Optimization Problems over Non-negative Polynomials with Interpolation Constraints

DOI10.1007/10997703_13MaRDI QIDQ4681656zbMATH OpenOpenAlexFDO

Authors Yvan Hachez, Yuri Nesterov

Publication date 24 June 2005

Published in Positive Polynomials in Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/10997703_13

zbMATH Keywords

complexityconesOptimization problems

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• Univariate polynomial optimization with sum-of-squares interpolants
• Constrained polynomial optimization problems with noncommuting variables
• Linear optimization with cones of moments and nonnegative polynomials
• scientific article; zbMATH DE number 3875913
• Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization

Cited in

(8)

• A convex optimization model for finding non-negative polynomials
• Finite Blaschke products with prescribed critical points, Stieltjes polynomials, and moment problems
• Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations
• Properties of the cone of non-negative polynomials and duality
• Tools and Algorithms for the Construction and Analysis of Systems
• Numerical experiments with universal barrier functions for cones of Chebyshev systems
• Univariate polynomial optimization with sum-of-squares interpolants
• Constrained polynomial optimization problems with noncommuting variables

This page was built for publication: Optimization Problems over Non-negative Polynomials with Interpolation Constraints

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