Pages that link to "Item:Q2481368"
From MaRDI portal
The following pages link to Global minimization of rational functions and the nearest GCDs (Q2481368):
Displayed 7 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)
- Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities (Q742119) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- On convex envelopes for bivariate functions over polytopes (Q2452372) (← links)