Name
Abstract | ||
|---|---|---|
Many problems in optimization theory are strongly nonlinear in the
traditional sense but possess a hidden linear structure over suitable
idempotent semirings. After an overview of `Idempotent Mathematics' with an
emphasis on matrix theory, interval analysis over idempotent semirings is
developed. The theory is applied to construction of exact interval solutions to
the interval discrete stationary Bellman equation. Solution of an interval
system is typically NP-hard in the traditional interval linear algebra; in the
idempotent case it is polynomial. A generalization to the case of positive
semirings is outlined. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1023/A:1011487725803 | Reliable Computing |
Keywords | Field | DocType |
discrete optimization,interval analysis,linear algebra,optimization problem,bellman equation,numerical analysis,matrix theory | Linear algebra,Discrete mathematics,Mathematical optimization,Polynomial,Algebra,Matrix (mathematics),Bellman equation,Idempotence,Interval arithmetic,Optimization problem,Idempotent matrix,Mathematics | Journal |
Volume | Issue | ISSN |
7 | 5 | 1573-1340 |
Citations | PageRank | References |
19 | 1.42 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Grigori L. Litvinov | 1 | 27 | 2.75 |
| Andrei N. Sobolevskiī | 2 | 19 | 1.42 |