null
Loading... Please wait...
FREE SHIPPING on All Unbranded Items LEARN MORE
Print This Page

Algorithms for Optimization

List Price: $100.00
SKU:
9780262039420
Quantity:
Minimum Purchase
25 unit(s)
  • Availability: Confirm prior to ordering
  • Branding: minimum 50 pieces (add’l costs below)
  • Check Freight Rates (branded products only)

Branding Options (v), Availability & Lead Times

  • 1-Color Imprint: $2.00 ea.
  • Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
  • Belly-Band Wrap: $2.50 ea. (full-color printed)
  • Set-Up Charge: $45 per decoration
FULL DETAILS
  • Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
  • Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
  • Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
  • RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
  • Product Details

    Author:
    Mykel J. Kochenderfer, Tim A. Wheeler
    Format:
    Hardcover
    Pages:
    520
    Publisher:
    MIT Press (March 12, 2019)
    Imprint:
    The MIT Press
    Language:
    English
    Audience:
    General/trade
    ISBN-13:
    9780262039420
    ISBN-10:
    0262039427
    Weight:
    45.2oz
    Dimensions:
    8.31" x 9.31" x 1.38"
    File:
    RandomHouse-PRH_Book_Company_PRH_PRT_Onix_full_active_D20260705T121706_156890332-20260705.xml
    Folder:
    RandomHouse
    List Price:
    $100.00
    Country of Origin:
    United States
    Pub Discount:
    65
    Case Pack:
    10
    As low as:
    $77.00
    Publisher Identifier:
    P-RH
    Discount Code:
    A
    QuickShip:
    Yes
  • Overview

    A comprehensive introduction to optimization with a focus on practical algorithms for the design of engineering systems.

    This book offers a comprehensive introduction to optimization with a focus on practical algorithms. The book approaches optimization from an engineering perspective, where the objective is to design a system that optimizes a set of metrics subject to constraints. Readers will learn about computational approaches for a range of challenges, including searching high-dimensional spaces, handling problems where there are multiple competing objectives, and accommodating uncertainty in the metrics. Figures, examples, and exercises convey the intuition behind the mathematical approaches. The text provides concrete implementations in the Julia programming language.

    Topics covered include derivatives and their generalization to multiple dimensions; local descent and first- and second-order methods that inform local descent; stochastic methods, which introduce randomness into the optimization process; linear constrained optimization, when both the objective function and the constraints are linear; surrogate models, probabilistic surrogate models, and using probabilistic surrogate models to guide optimization; optimization under uncertainty; uncertainty propagation; expression optimization; and multidisciplinary design optimization. Appendixes offer an introduction to the Julia language, test functions for evaluating algorithm performance, and mathematical concepts used in the derivation and analysis of the optimization methods discussed in the text. The book can be used by advanced undergraduates and graduate students in mathematics, statistics, computer science, any engineering field, (including electrical engineering and aerospace engineering), and operations research, and as a reference for professionals.