Globally minimizing polynomials without evaluating derivatives
From MaRDI portal
Recommendations
- Global minimization of univariate functions by sequential polynomial approximation
- Simple global minimization algorithm for one-variable rational functions
- Algorithms for computing the global infimum and minimum of a polynomial function
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
- Global optimization with polynomials and the problem of moments
Cites work
Cited in
(13)- Unconstrained and constrained global optimization of polynomial functions in one variable
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Search for global extremum of factorable univariate functions
- Simple global minimization algorithm for one-variable rational functions
- A branch-and-reduce approach to global optimization
- An adaptive procedure for the global minimization of a class of polynomial functions
- A difference algorithm to find global minimizers of a polynomial
- scientific article; zbMATH DE number 3844490 (Why is no real title available?)
- Global minimization of univariate functions by sequential polynomial approximation
- Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
- ``Backward differential flow may not converge to a global minimizer of polynomials
This page was built for publication: Globally minimizing polynomials without evaluating derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3702410)
