Item description for Convex Analysis and Minimization Algorithms: Part 1: Fundamentals (Grundlehren der mathematischen Wissenschaften) by Jean-Baptiste Hiriart-Urruty & Claude Lemarechal...
Convex Analysis may be considered as a refinement of standard calculus, with equalities and approximations replaced by inequalities. As such, it can easily be integrated into a graduate study curriculum. Minimization algorithms, more specifically those adapted to non-differentiable functions, provide an immediate application of convex analysis to various fields related to optimization and operations research. These two topics making up the title of the book, reflect the two origins of the authors, who belong respectively to the academic world and to that of applications. Part I can be used as an introductory textbook (as a basis for courses, or for self-study); Part II continues this at a higher technical level and is addressed more to specialists, collecting results that so far have not appeared in books.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 1.25" Width: 6.75" Height: 9.75" Weight: 1.74 lbs.
Release Date Oct 30, 1996
ISBN 3540568506 ISBN13 9783540568506
Availability 117 units. Availability accurate as of Mar 28, 2017 12:36.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.
More About Jean-Baptiste Hiriart-Urruty & Claude Lemarechal
Hiriart-Urruty is Professor of Mathematics at Universite Paul Sabatier, Toulouse, France.
Reviews - What do customers think about Convex Analysis and Minimization Algorithms: Part 1: Fundamentals (Grundlehren der mathematischen Wissenschaften)?
A good reference to the bundle method Jan 27, 2001
Lemarechal and Kiwiel introduced the bundle method in the 80's as a means to optimise nonsmooth convex functions. Recently Christoph Helmberg developed a spectral bundle approach to solving semidefinite programs, by rewriting SDP's with a constant trace as eigenvalue optimisation problems. The Spectral bundle methods outperforms the traditional interior point approaches to SDP's as these methods are typically unable to handle large SDP's with a large number of constraints.
This book provides a detailed description of the bundle method for nondifferentiable optimisation. I am going to purchase a copy of this book (I already have volume one with me) and can only strongly recommend the book to anyone interested in nondifferentiable optimisation and semidefinite programming.