Amazon cover image
Image from Amazon.com

Global optimization using interval analysis

By: Material type: TextTextSeries: Monographs and textbooks in pure and applied mathematics no.; 264Publication details: 2004 Marcel Dekker New YorkEdition: 2nd ed., revised and expandedDescription: xvii, 489 p. : ill. ; 24 cmISBN:
  • 9780824740597
Subject(s): DDC classification:
  • 519.6 H2G5
Summary: Employing a closed set-theoretic foundation for interval computations, Global Optimization Using Interval Analysis simplifies algorithm construction and increases generality of interval arithmetic. This Second Edition contains an up-to-date discussion of interval methods for solving systems of nonlinear equations and global optimization problems. It expands and improves various aspects of its forerunner and features significant new discussions, such as those on the use of consistency methods to enhance algorithm performance. Provided algorithms are guaranteed to find and bound all solutions to these problems despite bounded errors in data, in approximations, and from use of rounded arithmetic. (http://www.crcpress.com/product/isbn/9780824740597)
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Item location Shelving location Call number Status Date due Barcode
Books Vikram Sarabhai Library Rack 33-A / Slot 1681 (2nd Floor, East Wing) General Stacks 519.6 H2G5 (Browse shelf(Opens below)) Available 172144

Employing a closed set-theoretic foundation for interval computations, Global Optimization Using Interval Analysis simplifies algorithm construction and increases generality of interval arithmetic. This Second Edition contains an up-to-date discussion of interval methods for solving systems of nonlinear equations and global optimization problems. It expands and improves various aspects of its forerunner and features significant new discussions, such as those on the use of consistency methods to enhance algorithm performance. Provided algorithms are guaranteed to find and bound all solutions to these problems despite bounded errors in data, in approximations, and from use of rounded arithmetic. (http://www.crcpress.com/product/isbn/9780824740597)

There are no comments on this title.

to post a comment.