Chebyshev model arithmetic for factorable functions
From MaRDI portal
Publication:1675562
DOI10.1007/s10898-016-0474-9zbMath1386.90119OpenAlexW2530773136WikidataQ59525488 ScholiaQ59525488MaRDI QIDQ1675562
Jai Rajyaguru, Benoît Chachuat, Mario E. Villanueva, Boris Houska
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0474-9
Related Items (5)
High-order quadrature on multi-component domains implicitly defined by multivariate polynomials ⋮ Towards rigorous robust optimal control via generalized high-order moment expansion ⋮ A connected component labeling algorithm for implicitly defined domains ⋮ Sensitivity Analysis of Uncertain Dynamic Systems Using Set-Valued Integration ⋮ Global optimization in Hilbert space
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence analysis of Taylor models and McCormick-Taylor models
- Discretize-then-relax approach for convex/concave relaxations of the solutions of parametric ODEs
- Convergence rate of McCormick relaxations
- Fast polynomial multiplication and convolutions related to the discrete cosine transform
- The cluster problem revisited
- Moments and sums of squares for polynomial optimization and related problems
- Tight convex underestimators for \({\mathcal{C}^2}\)-continuous problems. II: Multivariate functions
- Error of truncated Chebyshev series and other near minimax polynomial approximations
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Efficient control of the dependency problem based on Taylor model methods
- The cluster problem in multivariate global optimization
- Ellipsoidal calculus for estimation and control
- Computation and application of Taylor polynomials with interval remainder bounds
- Semidefinite programming relaxations for semialgebraic problems
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Taylor forms -- use and limits.
- Methods for bounding the range of a polynomial
- Multivariate McCormick relaxations
- Rigorous integration of non-linear ordinary differential equations in Chebyshev basis
- Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs
- Affine arithmetic: concepts and applications
- Computing numerically with functions instead of numbers
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Validated solutions of initial value problems for parametric ODEs
- Chebyshev interpolation polynomial-based tools for rigorous computing
- Rigorous global search using taylor models
- A new approach to the corona theorem for domains bounded by a C^1+α curve
- A computer-assisted proof of universality for area-preserving maps
- A Comparison of the Optimal Costs of Two Canonical Inventory Systems
- McCormick-Based Relaxations of Algorithms
- Introduction to Interval Analysis
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Transformation of Chebyshev–Bernstein Polynomial Basis
- An Extension of MATLAB to Continuous Functions and Operators
- Guaranteed parameter estimation of non-linear dynamic systems using high-order bounding techniques with domain and CPU-time reduction strategies
- Comments on “On the Polynomial Multiplication in Chebyshev Form”
- On Polynomial Multiplication in Chebyshev Basis
- On the Polynomial Multiplication in Chebyshev Form
- Complete search in continuous global optimization and constraint satisfaction
- An Extension of Chebfun to Two Dimensions
- Numerical Methods for Special Functions
- On Taylor Model Based Integration of ODEs
This page was built for publication: Chebyshev model arithmetic for factorable functions
