A general reliable quadratic form: An extension of affine arithmetic
The paper indicates a new way to generate bounds for the range of polynomial functions \(f\) over a hypercube \(X\subseteq\mathbb{R}^n\). To this end general quadratic forms (GQF) are used which are defined by \[ \widehat{\widehat x}= \varepsilon^T A\varepsilon+ b^T\varepsilon+c + e^+\varepsilon_{n+1}+ e^-\varepsilon_{n+2}+ e\varepsilon_{n+ 3}, \] where \(A\in\mathbb{R}^{n\times n}\), \(b\in\mathbb{R}^n\), \(c\in\mathbb{R}\), \((e^+, e^-, e)\in(\mathbb{R}^+)^3\), \(\varepsilon_i\in [-1,1]\) for \(i\in \{1,\dots, n\}\), \(\varepsilon_{n+1}\in [0,1]\), \(\varepsilon_{n+2}\in [-1,0]\), and \(\varepsilon_{n+3}\in [-1,1]\). Transfers are given from intervals to GQF and vice versa, and also from GQF to affine forms and vice versa. Here, an affine form is defined by \[ \widehat x= x_0+ \sum^n_{i=1} x_i\varepsilon_i \] with \(x_i\in\mathbb{R}\) and \(\varepsilon_i\in [-1, 1]\). The operations \(+\), \(-\), \(\times\) are defined for GQF, and with them an inclusion function \(\text{GQF}(X)\) for \(f(X)\). Properties of this function are proved including comparisons with other inclusion functions. Interval input data \(A\), \(b\), \(c\) were introduced in GQF in order to guarantee inclusion for input data which are non-machine numbers. This ends up with a so-called reliable general quadratic form. The operations \(+\), \(-\), \(\times\) are generalized to this new situation and an inclusion function is defined analogously to \(\text{GQF}(X)\). It is shown how GQF can be applied to global optimization for polynomials using a basic interval branch-and-bound algorithm of Moore and Skelboe [see \textit{H. Ratschek} and \textit{J. Rokne}, New computer methods for global optimization. (1988; Zbl 0648.65049)].
- Extensions of affine arithmetic: application to unconstrained global optimization
- Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
- scientific article; zbMATH DE number 4197279
- scientific article; zbMATH DE number 440791
- A lower bound for range enclosure in interval arithmetic
- Affine arithmetic: concepts and applications
- Extensions of affine arithmetic: application to unconstrained global optimization
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 3473200 (Why is no real title available?)
- scientific article; zbMATH DE number 1543292 (Why is no real title available?)
- scientific article; zbMATH DE number 1408651 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Estimating the level of affinity of a quadratic form
- The small octagons of maximal width
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
- Numerical certification of Pareto optimality for biobjective nonlinear problems
- Algorithm for min-range multiplication of affine forms
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Quadratic zonotopes. An extension of zonotopes to quadratic arithmetics
- A reliable affine relaxation method for global optimization
- Extensions of affine arithmetic: application to unconstrained global optimization
- Hybridizing two linear relaxation techniques in interval-based solvers
- Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers
This page was built for publication: A general reliable quadratic form: An extension of affine arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494411)
