Global minimization of rational functions and the nearest GCDs
From MaRDI portal
Publication:2481368
DOI10.1007/S10898-006-9119-8zbMATH Open1138.90030arXivmath/0601110OpenAlexW1971521743MaRDI QIDQ2481368FDOQ2481368
Ming Gu, James Demmel, Jiawang Nie
Publication date: 9 April 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Abstract: This paper has been withdrawn by the authors due to its publication
Full work available at URL: https://arxiv.org/abs/math/0601110
Recommendations
- Minimizing the sum of many rational functions
- An algorithm of global optimization for rational functions with rational constraints
- Global optimization of rational functions: a semidefinite programming approach
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- Approximate gcds of polynomials and sparse SOS relaxations
Cites Work
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Convex Analysis
- Title not available (Why is that?)
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- GloptiPoly
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Semidefinite programming relaxations for semialgebraic problems
- Global optimization of rational functions: a semidefinite programming approach
- Minimizing polynomials via sum of squares over the gradient ideal
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Semidefinite representations for finite varieties
- SOSTOOLS and Its Control Applications
- On the complexity of Putinar's Positivstellensatz
- On approximate GCDs of univariate polynomials
- Title not available (Why is that?)
- Numerical Polynomial Algebra
- The truncated complex $K$-moment problem
- Distinguished representations of non-negative polynomials
- Complexity estimates for the Schmüdgen Positivstellensatz
- Title not available (Why is that?)
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Theory of Subresultants
- Title not available (Why is that?)
- Sparsity in sums of squares of polynomials
- A polynomial-time algorithm for the topological type of real algebraic curve
- Algorithms for intersecting parametric and algebraic curves I
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
Cited In (17)
- A subdivision method for computing nearest gcd with certification
- Model-based testing of probabilistic systems
- Minimizing the sum of many rational functions
- Rational functions with prescribed global and local minimizers
- Approximate square-free part and decomposition
- Rational Generalized Nash Equilibrium Problems
- A review of recent advances in global optimization
- Saddle points of rational functions
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- Global optimization of rational functions: a semidefinite programming approach
- Overdetermined Weierstrass iteration and the nearest consistent system
- An optimal Q-OR Krylov subspace method for solving linear systems
- On convex envelopes for bivariate functions over polytopes
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- An algorithm of global optimization for rational functions with rational constraints
- Approximate gcds of polynomials and sparse SOS relaxations
Uses Software
This page was built for publication: Global minimization of rational functions and the nearest GCDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481368)
