Skip to content

Due to technical disruption we are experiencing some delays to publication. We are working hard to restore services as soon as possible and apologise for the inconvenience caused. Find out more

Register Sign in Wishlist
Introduction to Derivative-Free Optimization

Introduction to Derivative-Free Optimization

  • Date Published: April 2009
  • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • format: Paperback
  • isbn: 9780898716689

Paperback

Add to wishlist

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • The absence of derivatives, often combined with the presence of noise or lack of smoothness, is a major challenge for optimization. This book explains how sampling and model techniques are used in derivative-free methods and how these methods are designed to efficiently and rigorously solve optimization problems. Although readily accessible to readers with a modest background in computational mathematics, it is also intended to be of interest to researchers in the field. Introduction to Derivative-Free Optimization is the first contemporary comprehensive treatment of optimization without derivatives. This book covers most of the relevant classes of algorithms from direct search to model-based approaches. It contains a comprehensive description of the sampling and modeling tools needed for derivative-free optimization; these tools allow the reader to better analyze the convergent properties of the algorithms and identify their differences and similarities.

    • Intended for anyone interested in using optimization on problems where derivatives are difficult or impossible to obtain
    • Includes a comprehensive description of the sampling and modeling tools needed for derivative-free optimization
    • Contains analysis of convergence for modified Nelder–Mead and implicit-filtering methods as well as for model-based methods
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: April 2009
    • format: Paperback
    • isbn: 9780898716689
    • length: 295 pages
    • dimensions: 255 x 178 x 15 mm
    • weight: 0.53kg
    • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • Table of Contents

    Preface
    1. Introduction
    Part I. Sampling and Modeling:
    2. Sampling and linear models
    3. Interpolating nonlinear models
    4. Regression nonlinear models
    5. Underdetermined interpolating models
    6. Ensuring well poisedness and suitable derivative-free models
    Part II. Frameworks and Algorithms:
    7. Directional direct-search methods
    8. Simplicial direct-search methods
    9. Line-search methods based on simplex derivatives
    10. Trust-region methods based on derivative-free models
    11. Trust-region interpolation-based methods
    Part III. Review of Other Topics:
    12. Review of surrogate model management
    13. Review of constrained and other extensions to derivative-free optimization
    Appendix: software for derivative-free optimization
    Bibliography
    Index.

  • Resources for

    Introduction to Derivative-Free Optimization

    Andrew R. Conn, Katya Scheinberg, Luís N. Vicente

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact lecturers@cambridge.org.

  • Authors

    Andrew R. Conn, IBM T J Watson Research Center, New York

    Katya Scheinberg, IBM T J Watson Research Center, New York

    Luís N. Vicente, Universidade de Coimbra, Portugal

Related Books

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon
×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×