Pages that link to "Item:Q2481368"

The following pages link to Global minimization of rational functions and the nearest GCDs (Q2481368):

Displaying 13 items.

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