Loading... Please wait...

Methods of Dynamic and Nonsmooth Optimization

Hover over image to zoom

$45.00
Order Code:
CB57

 Product Description

by Frank H. Clarke

-

1989 / v + 90 pages / Softcover / ISBN: 978-0-898712-41-4 / List Price $45.00 / SIAM/CBMS Member Price $31.50 / Order Code CB57

Presents the elements of a unified approach to optimization based on "nonsmooth analysis," a term introduced in the 1970's by the author, who is a pioneer in the field. Based on a series of lectures given at a conference at Emory University in 1986, this volume presents its subjects in a self-contained and accessible manner. The topics treated here have been in an active state of development, and this work therefore incorporates more recent results than those presented in 1986.

Focuses mainly on deterministic optimal control, the calculus of variations, and mathematical programming. In addition, it features a tutorial in nonsmooth analysis and geometry and demonstrates that the method of value function analysis via proximal normals is a powerful tool in the study of necessary conditions, sufficient conditions, controllability, and sensitivity analysis. The distinction between inductive and deductive methods, the use of Hamiltonians, the verification technique, and penalization are also emphasized.

Contents
Nonsmooth Analysis and Geometry; The Basic Problem in the Calculus of Variations; Verification Functions and Dynamic Programming; Optimal Control; References.


ISBN: 9780898712414

 Find Similar Products by Category

 Product Reviews

This product hasn't received any reviews yet. Be the first to review this product!

 

newsletter

Follow us on

Copyright 2014 SIAM Bookstore. All Rights Reserved.
Sitemap | BigCommerce Premium Themes by PSDCenter

Society for Industrial and Applied Mathematics 3600 Market St., 6th Fl. Philadelphia, PA 19104-2688 USA +1-215-382-9800 FAX: +1-215-386-7999 www.siam.org email: siambooks@siam.org

Click the button below to add the Methods of Dynamic and Nonsmooth Optimization to your wish list.