Chebyshev model arithmetic for factorable functions
From MaRDI portal
Publication:1675562
Search methods for problems in global optimization depend on the ability to compute enclosures for the range of nonconvex functions and constraints of the optimization problems. The focus of the paper is on polynomial models, which approximate multivariate functions. Especially enclosures in the form of a polynomial approximant of a given order and an interval remainder bound on the approximation error are considered. The paper presents a Chebyshev model arithmetic in order to compute enclosures for a class of factorable functions. Convergence properties of the proposed Chebyshev model are investigated. In the concluding part of the paper the authors present numerical examples, which illustrate obtained theoretical results.
Recommendations
- Chebyshev interpolation polynomial-based tools for rigorous computing
- Computation and application of Taylor polynomials with interval remainder bounds
- Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY
- Enclosing Chebyshev expansions in linear time
- scientific article; zbMATH DE number 1916891
Cites work
- A Comparison of the Optimal Costs of Two Canonical Inventory Systems
- A computer-assisted proof of universality for area-preserving maps
- A new approach to the corona theorem for domains bounded by a \(C^{1+\alpha}\) curve
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Affine arithmetic: concepts and applications
- An Extension of Chebfun to Two Dimensions
- An Extension of MATLAB to Continuous Functions and Operators
- Approximation theory and approximation practice
- Chebyshev interpolation polynomial-based tools for rigorous computing
- Comments on “On the Polynomial Multiplication in Chebyshev Form”
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computation and application of Taylor polynomials with interval remainder bounds
- Computing numerically with functions instead of numbers
- Convergence analysis of Taylor models and McCormick-Taylor models
- Convergence rate of McCormick relaxations
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
- Efficient control of the dependency problem based on Taylor model methods
- Ellipsoidal calculus for estimation and control
- Error of truncated Chebyshev series and other near minimax polynomial approximations
- Fast polynomial multiplication and convolutions related to the discrete cosine transform
- Guaranteed parameter estimation of non-linear dynamic systems using high-order bounding techniques with domain and CPU-time reduction strategies
- scientific article; zbMATH DE number 992811 (Why is no real title available?)
- scientific article; zbMATH DE number 3874497 (Why is no real title available?)
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 1862742 (Why is no real title available?)
- scientific article; zbMATH DE number 1916891 (Why is no real title available?)
- scientific article; zbMATH DE number 804609 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- Introduction to Interval Analysis
- McCormick-Based Relaxations of Algorithms
- Methods for bounding the range of a polynomial
- Moments and sums of squares for polynomial optimization and related problems
- Multivariate McCormick relaxations
- Numerical Methods for Special Functions
- On Polynomial Multiplication in Chebyshev Basis
- On Taylor Model Based Integration of ODEs
- On the Polynomial Multiplication in Chebyshev Form
- Rigorous global search using taylor models
- Rigorous integration of non-linear ordinary differential equations in Chebyshev basis
- Semidefinite programming relaxations for semialgebraic problems
- Taylor forms -- use and limits.
- The cluster problem in multivariate global optimization
- The cluster problem revisited
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Transformation of Chebyshev–Bernstein Polynomial Basis
- Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs
- Validated solutions of initial value problems for parametric ODEs
Cited in
(8)- Global optimization in Hilbert space
- Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY
- High-order quadrature on multi-component domains implicitly defined by multivariate polynomials
- Chebyshev interpolation polynomial-based tools for rigorous computing
- Towards rigorous robust optimal control via generalized high-order moment expansion
- Convergence analysis of Taylor models and McCormick-Taylor models
- Sensitivity analysis of uncertain dynamic systems using set-valued integration
- A connected component labeling algorithm for implicitly defined domains
This page was built for publication: Chebyshev model arithmetic for factorable functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675562)
