Global minimization of rational functions and the nearest GCDs
From MaRDI portal
Publication:2481368
DOI10.1007/s10898-006-9119-8zbMath1138.90030arXivmath/0601110MaRDI 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
90C30: Nonlinear programming
Related Items
Rational Generalized Nash Equilibrium Problems, A heuristic verification of the degree of the approximate GCD of two univariate polynomials, Overdetermined Weierstrass iteration and the nearest consistent system, A subdivision method for computing nearest gcd with certification, Model-based testing of probabilistic systems, Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities, A review of recent advances in global optimization, An optimal Q-OR Krylov subspace method for solving linear systems, Approximate square-free part and decomposition, Saddle points of rational functions, Tight relaxations for polynomial optimization and Lagrange multiplier expressions, Approximate gcds of polynomials and sparse SOS relaxations, On convex envelopes for bivariate functions over polytopes
Uses Software
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
