Rigorous global search using taylor models
Beale functiondynamical systemerror boundHénon attractorHénon mapinterval arithmeticrigorous global optimizationTaylor modelTaylor polynomial
Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Interval and finite arithmetic (65G30) Numerical optimization and variational techniques (65K10) Symbolic computation and algebraic computation (68W30) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
- Formal Global Optimisation with Taylor Models
- Rigorous global search: continuous problems
- scientific article; zbMATH DE number 3920212
- scientific article; zbMATH DE number 1440902
- The global search in the Tikhonov scheme
- Interactive model-based search for global optimization
- Global optimization by multilevel search
- scientific article; zbMATH DE number 778142
- Global optimization based on local searches
- Efficient control of the dependency problem based on Taylor model methods
- Computation and application of Taylor polynomials with interval remainder bounds
- Chebyshev model arithmetic for factorable functions
- Symbolic preconditioning with Taylor models: Some examples
- Certification of real inequalities: templates and sums of squares
- Chebyshev interpolation polynomial-based tools for rigorous computing
- Formal Global Optimisation with Taylor Models
- scientific article; zbMATH DE number 1916891 (Why is no real title available?)
- Efficient and accurate computation of upper bounds of approximation errors
This page was built for publication: Rigorous global search using taylor models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959013)