Find out how to access preview-only content
Idempotent Interval Analysis and Optimization Problems
- Grigori L. Litvinov,
- Andrei N. Sobolevskiī
- … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
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.
This revised version was published online in August 2006 with corrections to the Cover Date.
- Alefeld, G., Herzberger, J. (1983) Introduction to Interval Computations. Academic Press, New York
- Avdoshin, S. M., Belov, V. V., Maslov, V. P. (1984) Mathematical Aspects of Computational Media Design. MIEM Press, Moscow
- Baccelli, F. L., Cohen, G., Olsder, G. J., Quadrat, J.-P. (1992) Synchronization and Linearity: An Algebra for Discrete Event Systems. John Wiley & Sons Publishers, New York
- Backhouse, R., Carré, B. A. (1975) Regular Algebra Applied to Path-Finding Problems. J. Inst. Maths Applics 15: pp. 161-186
- Barth, W., Nuding, E. (1974) Optimale Lösung von Intervallgleichungsystemen. Computing 12: pp. 117-125 CrossRef
- Carré, B. A. (1971) An Algebra for Network Routing Problems. J. Inst. Maths Applics 7: pp. 273-294
- Carré, B. A. (1979) Graphs and Networks. Oxford University Press, Oxford
- Coxson, G. E. (1999) Computing Exact Bounds on Elements of an Inverse Interval Matrix Is NP-hard. Reliable Computing 5: pp. 137-142 CrossRef
- Dudnikov, P. S. and Samborskii, S.N.: Endomorphisms of Finitely Generated Free Semimodules, in [32], pp. 65-85.
- Dudnikov, P. S., Samborskii, S. N. (1987) Endomorphisms of Semimodules over Semirings with an Idempotent Operation. Izv. Akad. Nauk SSSR. Mathematical Institute of Ukrainian Academy of Sciences, Kiev, pp. 93-109
- Golan, J. (2000) Semirings and Their Applications. Kluwer Academic Publishers, Dordrecht
- Gunawardena, J. eds. (1998) Idempotency. Publ. of the Newton Institute, Cambridge University Press, Cambridge
- Kaucher, E. (1977) Algebraische Erweiterungen der Intervallrechnung unter Erhaltung Ordnungs-und Verbandsstrukturen. Computing 1: pp. 65-79
- Kaucher, E. (1980) Interval Analysis in the Extended Interval Space. Computing, Suppl. 2: pp. 33-49
- Kearfott, R. B. (1996) Rigorous Global Search: Continuous Problems. Kluwer Academic Publishers, Dordrecht
- Kleene, S. C. Representation of Events in Nerve Sets and Finite Automata. In: McCarthy, J., Shannon, C. eds. (1956) Automata Studies. Princeton University Press, Princeton, pp. 3-40
- Kolokoltsov, V. N., Maslov, V. P. (1997) Idempotent Analysis and Applications. Kluwer Academic Publishers, Dordrecht
- Kreinovich, V., Lakeyev, A. V., Noskov, S. I. (1993) Optimal Solution of Interval Linear Systems Is Intractable (NP-Hard). Interval Computations 1: pp. 6-14
- Kreinovich, V., Lakeyev, A. V., Rohn, J. Computational Complexity of Interval Algebraic Problems: Some Are Feasible and Some Are Computationally Intractable: A Survey. In: Alefeld, G., Frommer, A., Lang, B. eds. (1996) Scientific Computing and Validated Numerics. Akademie Verlag, Berlin, pp. 293-306
- Kreinovich, V., Lakeyev, A. V., Rohn, J., Kahl, P. (1998) Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer Academic Publishers, Dordrecht
- Lakeyev, A. V., Kreinovich, V. (1997) NP-Hard Classes of Linear Algebraic Systems with Uncertainties. Reliable Computing 3: pp. 51-81 CrossRef
- Lakeyev, A. V., Noskov, S. I. (1993) Description of the Solution Set to Linear Equation with the Intervally Defined Operator and Right-Hand Side. Doklady Akademii Nauk 330: pp. 430-433
- Lakeyev, A. V., Noskov, S. I. (1994) Description of the Solution Set to Linear Equation with the Intervally Defined Operator and Right-Hand Side. Sibirskii Mat. Zhurnal 35: pp. 1074-1084
- Lehmann, D. (1977) Algebraic Structures for Transitive Closure. Theor. Comput. Sc. 4: pp. 59-76 CrossRef
- Litvinov, G. L., Maslov, V. P. (1995) Correspondence Principle for Idempotent Calculus and Some Computer Applications 12: pp. 420-443
- Litvinov, G. L., Maslov, V. P., and Rodionov, A. Ya.: A Unifying Approach to Software and Hardware Design for Scientific Calculations and Idempotent Mathematics, Reliable Computing, submitted.
- Litvinov, G.L., Maslov, V. P., and Rodionov, A.Ya.:UnifyingApproach to Software andHardware Design for Scientific Calculations, preprint, International Sophus Lie Centre, 1995, see also http://sophus-lie.euro.ru/biblio/idempan/lrkluw.ps, quant-ph/9904024, LANL e-print archive (http://arXiv.org).
- Litvinov, G. L., Maslov, V. P., and Shpiz, G. B.: Idempotent Functional Analysis: An Algebraic Approach, preprint, International Sophus Lie Centre, 1998 (in Russian; to be published in Math. Notes 69(5) (2001) in English), see also http://sophuslie. euro.ru/biblio/idempan/funanto.ps (in Russian), math.FA/0009128, LANL e-print archive (http://arXiv.org; in English).
- Litvinov, G. L., Maslov, V. P., Shpiz, G. B. (1998) Linear Functionals on Idempotent Spaces: An Algebraic Approach. Doklady Akademii Nauk 363: pp. 298-300
- Litvinov, G. L., Sobolevski?, A. N. (2000) Exact Interval Solutions of the Discrete Bellman Equation and Polynomial Complexity of Problems in Interval Idempotent Linear Algebra. Doklady Akademii Nauk 374: pp. 304-306
- Maslov, V. P. (1986) New Superposition Principle for Optimization Problems. Seminaire sur les Equations aux Dérivées Partielles 1985/86. Centre Mathematique de l'Ecole Polytechnique, Palaiseau
- Maslov, V. P. and Samborskii, S. N. (eds): Idempotent Analysis (Advances in Soviet Mathematics, Vol. 13), American Mathematical Society, Providence, 1992.
- Moore, R. E. (1979) Methods and Applications of Interval Analysis. SIAM, Philadelphia
- Neumaier, A. (1990) Interval Methods for Systems of Equations. Cambridge University Press, Cambridge
- Rote, G. (1985) A Systolic Array Algorithm for the Algebraic Path Problem (Shortest Path; Matrix Inversion). Computing 34: pp. 191-219 CrossRef
- Shary, S. P. (1997) Algebraic Approach in the “Outer Problem” for Interval Linear Equations. Reliable Computing 3: pp. 103-135 CrossRef
- Shary, S. P. (1996) Algebraic Approach to the Interval Linear Static Identification, Tolerance, and Control Problems, or One More Application of Kaucher Arithmetic. Reliable Computing 2: pp. 3-33 CrossRef
- Sobolevski?, A. N. (1999) Interval Arithmetic and Linear Algebra over Idempotent Semirings. Doklady Akademii Nauk 369: pp. 747-749
- Voevodin, V. V. (1991) Mathematical Foundations of Parallel Computations. Moscow State University Press, Moscow
- Title
- Idempotent Interval Analysis and Optimization Problems
- Journal
-
Reliable Computing
Volume 7, Issue 5 , pp 353-377
- Cover Date
- 2001-10-01
- DOI
- 10.1023/A:1011487725803
- Print ISSN
- 1385-3139
- Online ISSN
- 1573-1340
- Publisher
- Kluwer Academic Publishers
- Additional Links
- Topics
- Authors
- Author Affiliations
-
- 1. Nagornaya, International Sophus Lie Centre, 27-4-72, Moscow, 113186, Russia
- 2. M. V. Lomonosov Moscow State University, Russia
