Practical Mathematical Optimization [electronic resource] : An Introduction to Basic Optimization Theory and Classical and New Gradient-Based Algorithms / by Jan A. Snyman.

By: Snyman, Jan A [author.]
Contributor(s): SpringerLink (Online service)
Material type: TextTextSeries: Applied Optimization: 97Publisher: Boston, MA : Springer US, 2005Description: XX, 258 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9780387243498Subject(s): Mathematics | Algorithms | Numerical analysis | Mathematical optimization | Operations research | Management science | Mathematics | Optimization | Algorithms | Operations Research, Management Science | Numerical AnalysisAdditional physical formats: Printed edition:: No titleDDC classification: 519.6 LOC classification: QA402.5-402.6Online resources: Click here to access online
Contents:
Line Search Descent Methods for Unconstrained Minimization -- Standard Methods for Constrained Optimization -- New Gradient-Based Trajectory and Approximation Methods -- Example Problems -- Some Theorems.
In: Springer eBooksSummary: This book presents basic optimization principles and gradient-based algorithms to a general audience, in a brief and easy-to-read form without neglecting rigour. The work should enable the professional to apply optimization theory and algorithms to his own particular practical field of interest, be it engineering, physics, chemistry, or business economics. Most importantly, for the first time in a relatively brief and introductory work, due attention is paid to the difficulties—such as noise, discontinuities, expense of function evaluations, and the existence of multiple minima—that often unnecessarily inhibit the use of gradient-based methods. In a separate chapter on new gradient-based methods developed by the author and his coworkers, it is shown how these difficulties may be overcome without losing the desirable features of classical gradient-based methods. Audience It is intended that this book be used in senior- to graduate-level semester courses in optimization, as offered in mathematics, engineering, computer science, and operations research departments, and also to be useful to practising professionals in the workplace.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Line Search Descent Methods for Unconstrained Minimization -- Standard Methods for Constrained Optimization -- New Gradient-Based Trajectory and Approximation Methods -- Example Problems -- Some Theorems.

This book presents basic optimization principles and gradient-based algorithms to a general audience, in a brief and easy-to-read form without neglecting rigour. The work should enable the professional to apply optimization theory and algorithms to his own particular practical field of interest, be it engineering, physics, chemistry, or business economics. Most importantly, for the first time in a relatively brief and introductory work, due attention is paid to the difficulties—such as noise, discontinuities, expense of function evaluations, and the existence of multiple minima—that often unnecessarily inhibit the use of gradient-based methods. In a separate chapter on new gradient-based methods developed by the author and his coworkers, it is shown how these difficulties may be overcome without losing the desirable features of classical gradient-based methods. Audience It is intended that this book be used in senior- to graduate-level semester courses in optimization, as offered in mathematics, engineering, computer science, and operations research departments, and also to be useful to practising professionals in the workplace.

There are no comments for this item.

to post a comment.

Powered by Koha