An Introduction to Unconstrained Optimisation

1. Auflage 1990
ISBN: 978-0-7503-0025-4
Verlag: CRC Press

Buch, Englisch, 130 Seiten, Format (B × H): 156 mm x 235 mm, Gewicht: 204 g

Integrating computer graphics and computer-based exercises with the text, An Introduction to Unconstrained Optimisation illustrates key methods with many examples and exercises using the computer. The book takes an elementary approach to this advanced topic, allowing readers to concentrate on learning and understanding the concepts of numerical optimization without unnecessary involvement in the intricacies of the subject. In addition, the modular approach of the software provides the opportunity to explore the algorithms used and to develop them further or try alternative approaches.

Most of the algorithms are based upon a "hill-climbing" concept which, in two dimensions, is illustrated dynamically on the computer screen in the form of contour plots and search directions. The text is not specific to any particular microcomputer. Software is available for the BBC series of machines (40/80 track disc formats) and PC-compatible machines. The software is not available from your local bookstore, but is easily obtainable using the order form in the book.

Keeping proofs and lists of methods to a minimum, the book is at a level suitable for a first course in numerical analysis, with a basic knowledge of calculus and vector algebra assumed. This book/software package will be of interest to professionals, teachers, and undergraduate students in mathematics, operational research, science, and engineering as well as economics and management courses that deal with quantitative methods.

Zielgruppe

Professional

Autoren/Hrsg.

McKeown, J.

Meegan, D

Sprevak, D

Fachgebiete

• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik EDV | Informatik Informatik
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik

Inhaltsverzeichnis

Getting started. Searching for an optimum. Line searches. Direct search methods. Steepest descent. Conjugate gradients. Newton's method. Quasi-Newton methods. Least squares. Global optimisation. Optimisation in practice.

Über Autor(innen)

J McKeown (Queen's University of Belfast, N. Ireland) (Author), D Meegan (Queen's University of Belfast, N. Ireland) (Author), D Sprevak (Queen's University of Belfast, N. Ireland) (Author)