Name
Abstract | ||
|---|---|---|
In this paper, we analyze the problem of the optimal (narrowest) approximation (enclosure) of a quadratic interval function
<img src="/fulltext-image.asp?format=htmlnonpaginated&src=T1R460Q305K4M6R0_html\11155_2004_Article_187350_TeX2GIFIE1.gif" border="0" alt="
$$y(x_1 ,...,x_n ) = [y(x_1 ,...,x_n ) \bar y(x_1 ,...x_n )]$$
" /> (i.e., an interval function for which both endpoint functions
<img src="/fulltext-image.asp?format=htmlnonpaginated&src=T1R460Q305K4M6R0_html\11155_2004_Article_187350_TeX2GIFIE2.gif" border="0" alt="
$$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{y} (x_1 ,...,x_n ) {\text{and}} \bar y(x_1 ,...x_n )$$
" />, ..., xn) are quadratic) by a linear interval function. show that in general, this problem is computationally intractable (NP-hard). For a practically important 1D case (n = 1), we present an efficient algorithm. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1023/A:1024415715798 | Reliable Computing |
Keywords | Field | DocType |
Mathematical Modeling, Computational Mathematic, Industrial Mathematic, Efficient Algorithm, Interval Function | Discrete mathematics,Mathematical optimization,Combinatorics,Enclosure,Quadratic equation,Mathematics | Journal |
Volume | Issue | ISSN |
4 | 4 | 1573-1340 |
Citations | PageRank | References |
2 | 0.43 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Misha Koshelev | 1 | 22 | 8.60 |
| Luc Longpré | 2 | 245 | 30.26 |
| Patrick Taillibert | 3 | 77 | 15.76 |