메뉴 건너뛰기




Volumn 124, Issue 1-2, 2000, Pages 263-280

Interval mathematics, algebraic equations and optimization

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR ALGEBRA; OPTIMIZATION;

EID: 0034541549     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00421-0     Document Type: Article
Times cited : (24)

References (67)
  • 1
    • 0032552252 scopus 로고    scopus 로고
    • A global optimization method, αBB, for general twice-differentiable constrained NLPs – II, Implementation and computational results
    • C.S. Adjiman I.P. Androulakis C.A. Floudas A global optimization method, α BB, for general twice-differentiable constrained NLPs – II, Implementation and computational results Comput. Chem. Eng. 22 1998 1159 1179
    • (1998) Comput. Chem. Eng. , vol.22 , pp. 1159-1179
    • Adjiman, C.S.1    Androulakis, I.P.2    Floudas, C.A.3
  • 2
    • 0032552250 scopus 로고    scopus 로고
    • A global optimization method, αBB, for general twice-differentiable constrained NLPs – I, Theoretical advances
    • C.S. Adjiman S. Dallwig C.A. Floudas A. Neumaier A global optimization method, α BB, for general twice-differentiable constrained NLPs – I, Theoretical advances Comput. Chem. Eng. 22 1998 1137 1158
    • (1998) Comput. Chem. Eng. , vol.22 , pp. 1137-1158
    • Adjiman, C.S.1    Dallwig, S.2    Floudas, C.A.3    Neumaier, A.4
  • 3
    • 85013506952 scopus 로고
    • Inclusion methods for systems of nonlinear equations – the interval Newton method and modifications
    • G. Alefeld Inclusion methods for systems of nonlinear equations – the interval Newton method and modifications J. Herzberger Topics in Validated Computations 1994 Elsevier Dordrecht 7 26
    • (1994) , pp. 7-26
    • Alefeld, G.1
  • 4
    • 0032043274 scopus 로고    scopus 로고
    • The basic properties of interval arithmetic, its software realizations and some applications
    • G. Alefeld D. Claudio The basic properties of interval arithmetic, its software realizations and some applications Comput. Struct. 67 1998 3 8
    • (1998) Comput. Struct. , vol.67 , pp. 3-8
    • Alefeld, G.1    Claudio, D.2
  • 5
    • 0028377769 scopus 로고
    • Efficient numerical validation of solutions of nonlinear systems
    • G. Alefeld A. Gienger F. Potra Efficient numerical validation of solutions of nonlinear systems SIAM J. Numer. Anal. 31 1994 252 260
    • (1994) SIAM J. Numer. Anal. , vol.31 , pp. 252-260
    • Alefeld, G.1    Gienger, A.2    Potra, F.3
  • 6
    • 85119564506 scopus 로고
    • G. Alefeld J. Herzberger Introduction to Interval Computations 1983 Academic Press New York
    • (1983)
    • Alefeld, G.1    Herzberger, J.2
  • 7
    • 0012321768 scopus 로고    scopus 로고
    • The shape of the symmetric solution set
    • G. Alefeld V. Kreinovich G. Mayer The shape of the symmetric solution set R.B. Kearfott V. Kreinovich Applications of Interval Computations 1996 Kluwer Academic Publishers Dordrecht 61 79
    • (1996) , pp. 61-79
    • Alefeld, G.1    Kreinovich, V.2    Mayer, G.3
  • 8
    • 85119554866 scopus 로고
    • M.S. Bazarraa and C.M. Shetty Foundations of Optimization, Lecture Notes in Economics and Mathematical Systems, Vol. 122 1976 Springer Berlin
    • (1976)
    • Bazarraa and C.M. Shetty, M.S.1
  • 10
    • 0003401332 scopus 로고
    • A Collection of Test Problems for Constrained Optimization, Lecture Notes in Computer Science, Vol. 455
    • C.A. Floudos P.M. Pardolos A Collection of Test Problems for Constrained Optimization, Lecture Notes in Computer Science, Vol. 455 1990 Springer Berlin
    • (1990)
    • Floudos, C.A.1    Pardolos, P.M.2
  • 11
    • 0025174478 scopus 로고
    • Efficient methods for enclosing solutions of systems of nonlinear equations
    • A. Frommer G. Mayer Efficient methods for enclosing solutions of systems of nonlinear equations Computing 44 1990 221 235
    • (1990) Computing , vol.44 , pp. 221-235
    • Frommer, A.1    Mayer, G.2
  • 12
    • 0025385990 scopus 로고
    • On the R-order of Newton-like methods for enclosing solutions of nonlinear equations
    • A. Frommer G. Mayer On the R-order of Newton-like methods for enclosing solutions of nonlinear equations SIAM J. Numer. Anal. 27 1990 105 116
    • (1990) SIAM J. Numer. Anal. , vol.27 , pp. 105-116
    • Frommer, A.1    Mayer, G.2
  • 13
    • 85119563577 scopus 로고    scopus 로고
    • A. Frommer, G. Mayer, Two-stage interval iterative methods, preprint, 1993.
  • 15
    • 0026938266 scopus 로고
    • Bounding the solution of interval linear equations
    • E.R. Hansen Bounding the solution of interval linear equations SIAM J. Numer. Anal. 29 1992 1493 1503
    • (1992) SIAM J. Numer. Anal. , vol.29 , pp. 1493-1503
    • Hansen, E.R.1
  • 16
    • 85119560283 scopus 로고
    • E. Hansen Global Optimization using Interval Analysis 1992 Marcel Dekker New York
    • (1992)
    • Hansen, E.1
  • 17
    • 44949266262 scopus 로고
    • Bounds for Lagrange multipliers and optimal points
    • E.R. Hansen G.W. Walster Bounds for Lagrange multipliers and optimal points Comput. Math. Appl. 25 1993 59 69
    • (1993) Comput. Math. Appl. , vol.25 , pp. 59-69
    • Hansen, E.R.1    Walster, G.W.2
  • 18
  • 19
    • 0042381722 scopus 로고
    • A branch and bound algorithm for bound constrained optimization problems without derivatives
    • C. Jansson O. Knüppel A branch and bound algorithm for bound constrained optimization problems without derivatives J. Global Optim. 7 1995 297 331
    • (1995) J. Global Optim. , vol.7 , pp. 297-331
    • Jansson, C.1    Knüppel, O.2
  • 20
    • 0026385462 scopus 로고
    • Decomposition of arithmetic expressions to improve the behaviour of interval iteration for nonlinear systems
    • R.B. Kearfott Decomposition of arithmetic expressions to improve the behaviour of interval iteration for nonlinear systems Computing 47 1991 169 191
    • (1991) Computing , vol.47 , pp. 169-191
    • Kearfott, R.B.1
  • 21
    • 85119564046 scopus 로고    scopus 로고
    • R.B. Kearfott Rigorous Global Search: Continuous Problems 1996 Kluwer Academic Publishers Dordrecht
    • (1996)
    • Kearfott, R.B.1
  • 23
    • 0000531809 scopus 로고    scopus 로고
    • A new method for global solution of systems of non-linear equations
    • L. Kolev A new method for global solution of systems of non-linear equations Reliab. Comput. 4 1998 125 146
    • (1998) Reliab. Comput. , vol.4 , pp. 125-146
    • Kolev, L.1
  • 24
    • 27144515961 scopus 로고    scopus 로고
    • Linear interval equations: computing enclosures with bounded relative or absolute overestimation is NP-hard
    • V. Kreinovich A. Lakeyev Linear interval equations: computing enclosures with bounded relative or absolute overestimation is NP-hard Reliab. Comput. 2 1996 341 350
    • (1996) Reliab. Comput. , vol.2 , pp. 341-350
    • Kreinovich, V.1    Lakeyev, A.2
  • 25
    • 0002561242 scopus 로고
    • Optimal solution of interval linear systems is intractible (NP-hard)
    • V. Kreinovich A. Lakeyev S. Noskov Optimal solution of interval linear systems is intractible (NP-hard) Interval Comput. 1 1993 6 14
    • (1993) Interval Comput. , vol.1 , pp. 6-14
    • Kreinovich, V.1    Lakeyev, A.2    Noskov, S.3
  • 26
    • 34249841999 scopus 로고
    • Some remarks on two interval-arithmetic modifications of the Newton method
    • G. Mayer Some remarks on two interval-arithmetic modifications of the Newton method Computing 48 1992 125 128
    • (1992) Computing , vol.48 , pp. 125-128
    • Mayer, G.1
  • 27
    • 0347957011 scopus 로고    scopus 로고
    • Success in epsilon-inflation
    • G. Mayer Success in epsilon-inflation G. Alefeld A. Frommer Scientific Computing and Validated Numerics 1996 Akademie Verlag Berlin 98 104
    • (1996) , pp. 98-104
    • Mayer, G.1
  • 28
    • 0009847416 scopus 로고
    • Epsilon inflation in verification algorithms
    • G. Mayer Epsilon inflation in verification algorithms J. Comput. Appl. Math. 60 1995 147 169
    • (1995) J. Comput. Appl. Math. , vol.60 , pp. 147-169
    • Mayer, G.1
  • 29
    • 0013365821 scopus 로고    scopus 로고
    • On the applicability of the interval Gaussian algorithm
    • G. Mayer J. Rohn On the applicability of the interval Gaussian algorithm Reliab. Comput. 4 1998 205 222
    • (1998) Reliab. Comput. , vol.4 , pp. 205-222
    • Mayer, G.1    Rohn, J.2
  • 30
    • 85119561956 scopus 로고    scopus 로고
    • R.E. Moore, Interval arithmetic and automatic error analysis in digital computing, Ph.D. Thesis, Stanford University, 1962.
  • 31
    • 0010051249 scopus 로고
    • A simple test for accuracy of approximate solutions to nonlinear (or linear) systems
    • R.E. Moore J.B. Kioustelidis A simple test for accuracy of approximate solutions to nonlinear (or linear) systems SIAM J. Numer. Anal. 17 1980 521 529
    • (1980) SIAM J. Numer. Anal. , vol.17 , pp. 521-529
    • Moore, R.E.1    Kioustelidis, J.B.2
  • 32
    • 85119556647 scopus 로고
    • A. Neumaier Interval Methods for Systems of Equations 1990 Cambridge University Press Cambridge
    • (1990)
    • Neumaier, A.1
  • 33
    • 0000374464 scopus 로고    scopus 로고
    • A comparison of some methods for solving linear interval equations
    • S. Ning R.B. Kearfott A comparison of some methods for solving linear interval equations SIAM J. Numer. Anal. 34 1997 1289 1305
    • (1997) SIAM J. Numer. Anal. , vol.34 , pp. 1289-1305
    • Ning, S.1    Kearfott, R.B.2
  • 34
    • 85119561672 scopus 로고
    • J.M. Ortega W.C. Rheinboldt Iterative Solution of Nonlinear Equations in Several Variables 1970 Academic Press New York
    • (1970)
    • Ortega, J.M.1    Rheinboldt, W.C.2
  • 35
    • 0022107380 scopus 로고
    • A convergence test and componentwise error estimates for Newton methods
    • M.C. Pandian A convergence test and componentwise error estimates for Newton methods SIAM J. Numer. Anal. 22 1985 779 791
    • (1985) SIAM J. Numer. Anal. , vol.22 , pp. 779-791
    • Pandian, M.C.1
  • 36
    • 0042899472 scopus 로고
    • A note on the Moore test for nonlinear systems
    • L. Qi A note on the Moore test for nonlinear systems SIAM J. Numer. Anal. 19 1982 851 857
    • (1982) SIAM J. Numer. Anal. , vol.19 , pp. 851-857
    • Qi, L.1
  • 37
    • 85119559948 scopus 로고
    • L.B. Rall Computational Solution of Nonlinear Operator Equations 1969 Wiley New York
    • (1969)
    • Rall, L.B.1
  • 38
    • 85119557586 scopus 로고
    • H. Ratschek J. Rokne New Computer Methods for Global Optimization 1988 Ellis Horwood Chichester
    • (1988)
    • Ratschek, H.1    Rokne, J.2
  • 39
    • 0025429679 scopus 로고
    • Global optimization over unbounded domains
    • H. Ratschek R.L. Voller Global optimization over unbounded domains SIAM J. Control Optim. 28 1990 528 539
    • (1990) SIAM J. Control Optim. , vol.28 , pp. 528-539
    • Ratschek, H.1    Voller, R.L.2
  • 40
    • 0003386697 scopus 로고
    • Interval methods
    • H. Ratschek J. Rokne Interval methods R. Horst P.M. Pardolos Handbook of Global Optimization 1995 Kluwer Academic Publishers Dordrecht 751 828
    • (1995) , pp. 751-828
    • Ratschek, H.1    Rokne, J.2
  • 41
    • 0346362782 scopus 로고
    • On nonconvexity of the solution set of a system of linear interval equations
    • J. Rohn On nonconvexity of the solution set of a system of linear interval equations BIT 30 1989 161 165
    • (1989) BIT , vol.30 , pp. 161-165
    • Rohn, J.1
  • 42
    • 0003137832 scopus 로고
    • Cheap and tight bounds: the recent result by E. Hansen can be made more efficient
    • J. Rohn Cheap and tight bounds: the recent result by E. Hansen can be made more efficient Interval Comput. 4 1993 13 21
    • (1993) Interval Comput. , vol.4 , pp. 13-21
    • Rohn, J.1
  • 43
    • 0342282809 scopus 로고    scopus 로고
    • Enclosing solutions of overdetermined systems of linear interval equations
    • J. Rohn Enclosing solutions of overdetermined systems of linear interval equations Reliab. Comput. 2 1996 167 171
    • (1996) Reliab. Comput. , vol.2 , pp. 167-171
    • Rohn, J.1
  • 44
    • 0345708716 scopus 로고    scopus 로고
    • Linear interval equations: computing enclosures with bounded relative overestimation is NP-hard
    • J. Rohn Linear interval equations: computing enclosures with bounded relative overestimation is NP-hard R.B. Kearfott V. Kreinovich Applications of Interval Computations 1996 Kluwer Academic Publishers Dordrecht 81 89
    • (1996) , pp. 81-89
    • Rohn, J.1
  • 45
    • 0042898787 scopus 로고    scopus 로고
    • On overestimation produced by the interval Gaussian algorithm
    • J. Rohn On overestimation produced by the interval Gaussian algorithm Reliab. Comput. 3 1997 363 368
    • (1997) Reliab. Comput. , vol.3 , pp. 363-368
    • Rohn, J.1
  • 46
    • 33746928018 scopus 로고
    • Verification methods for dense and sparse systems of equations
    • S.M. Rump Verification methods for dense and sparse systems of equations J. Herzberger Topics in Validated Computations 1994 Elsevier Amsterdam 63 135
    • (1994) , pp. 63-135
    • Rump, S.M.1
  • 47
    • 0029695223 scopus 로고    scopus 로고
    • Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems
    • S.M. Rump Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems Computing 57 1996 77 84
    • (1996) Computing , vol.57 , pp. 77-84
    • Rump, S.M.1
  • 48
    • 33847244045 scopus 로고    scopus 로고
    • A note on epsilon inflation
    • S.M. Rump A note on epsilon inflation Reliab. Comput. 4 1998 371 375
    • (1998) Reliab. Comput. , vol.4 , pp. 371-375
    • Rump, S.M.1
  • 49
    • 0000708074 scopus 로고    scopus 로고
    • Algebraic approach in the “outer problem” for interval linear equations
    • S.P. Shary Algebraic approach in the “outer problem” for interval linear equations Reliab. Comput. 3 1997 103 135
    • (1997) Reliab. Comput. , vol.3 , pp. 103-135
    • Shary, S.P.1
  • 50
    • 16444372804 scopus 로고    scopus 로고
    • An interval maximum entropy method for a discrete minimax problem
    • Z. Shen Z. Huang M.A. Wolfe An interval maximum entropy method for a discrete minimax problem Appl. Math. Comput. 87 1997 49 68
    • (1997) Appl. Math. Comput. , vol.87 , pp. 49-68
    • Shen, Z.1    Huang, Z.2    Wolfe, M.A.3
  • 51
    • 0023842821 scopus 로고
    • A note on Moore's interval test for zeros of nonlinear systems
    • Z. Shen A. Neumaier A note on Moore's interval test for zeros of nonlinear systems Computing 40 1988 85 90
    • (1988) Computing , vol.40 , pp. 85-90
    • Shen, Z.1    Neumaier, A.2
  • 52
    • 2842536882 scopus 로고
    • Solving minimax problems by interval methods
    • Z. Shen A. Neumaier M.C. Eiermann Solving minimax problems by interval methods BIT 30 1990 742 751
    • (1990) BIT , vol.30 , pp. 742-751
    • Shen, Z.1    Neumaier, A.2    Eiermann, M.C.3
  • 53
    • 23644461664 scopus 로고
    • On certain computable tests and componentwise error bounds
    • Z. Shen M.A. Wolfe On certain computable tests and componentwise error bounds Computing 50 1993 353 368
    • (1993) Computing , vol.50 , pp. 353-368
    • Shen, Z.1    Wolfe, M.A.2
  • 54
    • 85119556637 scopus 로고    scopus 로고
    • M.A. Wolfe, Interval methods for linear systems, in: E. Spedicato, M. Vespucci (Eds.), NATO Advanced Study Institute Computer Algorithms for Solving Linear Algebraic Equations: the State of the Art, Universita’ Degli Studi di Bergamo, 1990, pp. 128–140.
  • 55
    • 0028424125 scopus 로고
    • An interval algorithm for constrained global optimization
    • M.A. Wolfe An interval algorithm for constrained global optimization J. Comput. Appl. Math. 50 1994 605 612
    • (1994) J. Comput. Appl. Math. , vol.50 , pp. 605-612
    • Wolfe, M.A.1
  • 56
    • 0028697726 scopus 로고
    • On global optimization in R using interval arithmetic
    • M.A. Wolfe On global optimization in R using interval arithmetic Optim. Methods Software 3 1994 60 76
    • (1994) Optim. Methods Software , vol.3 , pp. 60-76
    • Wolfe, M.A.1
  • 57
    • 84951413520 scopus 로고
    • An interval algorithm for bound-constrained global optimization
    • M.A. Wolfe An interval algorithm for bound-constrained global optimization Optim. Methods Software 6 1995 145 159
    • (1995) Optim. Methods Software , vol.6 , pp. 145-159
    • Wolfe, M.A.1
  • 58
    • 0011909896 scopus 로고    scopus 로고
    • Interval methods for global optimization
    • M.A. Wolfe Interval methods for global optimization Appl. Math. Comput. 75 1996 179 206
    • (1996) Appl. Math. Comput. , vol.75 , pp. 179-206
    • Wolfe, M.A.1
  • 59
    • 0343589904 scopus 로고    scopus 로고
    • On a second derivative test due to Qi
    • M.A. Wolfe On a second derivative test due to Qi Reliab. Comput. 4 1998 223 234
    • (1998) Reliab. Comput. , vol.4 , pp. 223-234
    • Wolfe, M.A.1
  • 60
    • 85119552496 scopus 로고    scopus 로고
    • M.A. Wolfe, A note on a uniqueness theorem for the second-derivative test of Qi, to appear.
  • 61
    • 0011859372 scopus 로고    scopus 로고
    • On discrete minimax problems in R1 using interval arithmetic
    • 1 using interval arithmetic Reliab. Comput. 5 1999 371 383
    • (1999) Reliab. Comput. , vol.5 , pp. 371-383
    • Wolfe, M.A.1
  • 62
    • 85119560813 scopus 로고    scopus 로고
    • M.A. Wolfe, On bounding solutions of underdetermined systems, to appear.
  • 63
    • 0038786025 scopus 로고
    • An interval algorithm for nondifferentiable global optimization
    • M.A. Wolfe L.S. Zhang An interval algorithm for nondifferentiable global optimization Appl. Math. Comput. 63 1994 101 122
    • (1994) Appl. Math. Comput. , vol.63 , pp. 101-122
    • Wolfe, M.A.1    Zhang, L.S.2
  • 64
    • 0006834357 scopus 로고
    • Error bounds for Newton's iterates derived from the Kantorovich theorem
    • T. Yamamoto Error bounds for Newton's iterates derived from the Kantorovich theorem Numer. Math. 48 1986 91 98
    • (1986) Numer. Math. , vol.48 , pp. 91-98
    • Yamamoto, T.1
  • 65
    • 0030130215 scopus 로고    scopus 로고
    • An algorithm for representing functions of many variables by superpositions of functions of one variable and addition
    • K. Yamamura An algorithm for representing functions of many variables by superpositions of functions of one variable and addition IEEE Trans. Circuits Systems 1 43 1996 338 340
    • (1996) IEEE Trans. Circuits Systems , vol.1 , Issue.43 , pp. 338-340
    • Yamamura, K.1
  • 66
    • 0001601527 scopus 로고    scopus 로고
    • Interval solution of nonlinear equations using linear programming
    • K. Yamamura H. Kawata A. Tokue Interval solution of nonlinear equations using linear programming BIT 38 1 1998 186 199
    • (1998) BIT , vol.38 , Issue.1 , pp. 186-199
    • Yamamura, K.1    Kawata, H.2    Tokue, A.3
  • 67
    • 85119564263 scopus 로고    scopus 로고
    • Zhang Danqing, Li Weiguo, Shen Zuhe, Solving underdetermined systems with interval methods, Reliab. Comput. 5 (1999) 23–33.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.