Global minimization of rational functions and the nearest GCDs
From MaRDI portal
Publication:2481368
Abstract: This paper has been withdrawn by the authors due to its publication
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
- scientific article; zbMATH DE number 1601019 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1254271 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A polynomial-time algorithm for the topological type of real algebraic curve
- Algorithms for intersecting parametric and algebraic curves I
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Complexity estimates for the Schmüdgen Positivstellensatz
- Convex Analysis
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Distinguished representations of non-negative polynomials
- Global optimization of rational functions: a semidefinite programming approach
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Minimizing polynomials via sum of squares over the gradient ideal
- Numerical Polynomial Algebra
- On Euclid's Algorithm and the Theory of Subresultants
- On approximate GCDs of univariate polynomials
- On the complexity of Putinar's Positivstellensatz
- SOSTOOLS and Its Control Applications
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite representations for finite varieties
- Sparsity in sums of squares of polynomials
- Subresultants and Reduced Polynomial Remainder Sequences
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- The truncated complex $K$-moment problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(17)- Approximate gcds of polynomials and sparse SOS relaxations
- 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
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)
