Global minimization of rational functions and the nearest GCDs

DOI10.1007/S10898-006-9119-8zbMath1138.90030arXivmath/0601110OpenAlexW1971521743MaRDI QIDQ2481368

Ming Gu, James W. Demmel, Jia-Wang Nie

Publication date: 9 April 2008

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

greatest common divisorpolynomialquadratic modulesum of squares (SOS)

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (13)

A review of recent advances in global optimization ⋮ Approximate gcds of polynomials and sparse SOS relaxations ⋮ Rational Generalized Nash Equilibrium Problems ⋮ A subdivision method for computing nearest gcd with certification ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ On convex envelopes for bivariate functions over polytopes ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Approximate square-free part and decomposition ⋮ An optimal Q-OR Krylov subspace method for solving linear systems ⋮ Model-based testing of probabilistic systems ⋮ Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities ⋮ Saddle points of rational functions ⋮ Tight relaxations for polynomial optimization and Lagrange multiplier expressions

Uses Software

• Unnamed Item
• SeDuMi
• GloptiPoly
• YALMIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semidefinite representations for finite varieties
• On the complexity of Putinar's Positivstellensatz
• A polynomial-time algorithm for the topological type of real algebraic curve
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• On approximate GCDs of univariate polynomials
• Semidefinite programming relaxations for semialgebraic problems
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Sparsity in sums of squares of polynomials
• Distinguished representations of non-negative polynomials
• Global optimization of rational functions: a semidefinite programming approach
• Minimizing polynomials via sum of squares over the gradient ideal
• Complexity estimates for the Schmüdgen Positivstellensatz
• Global Optimization with Polynomials and the Problem of Moments
• Algorithms for intersecting parametric and algebraic curves I
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• SOSTOOLS and Its Control Applications
• Detecting Global Optimality and Extracting Solutions in GloptiPoly
• Numerical Polynomial Algebra
• The truncated complex $K$-moment problem
• GloptiPoly
• Semidefinite Approximations for Global Unconstrained Polynomial Optimization
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Subresultants and Reduced Polynomial Remainder Sequences
• Convex Analysis
• On Euclid's Algorithm and the Theory of Subresultants
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Global minimization of rational functions and the nearest GCDs