Convex Analysis and Minimization Algorithms I - Fundamentals (Hardcover, 1st ed. 1993. 2nd corr. printing 1996)

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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Grundlehren der mathematischen Wissenschaften, 305
Release date:	October 1996
First published:	October 1996
Authors:	Jean-Baptiste Hiriart-Urruty • Claude Lemar echal
Dimensions:	235 x 155 x 25mm (L x W x T)
Format:	Hardcover
Pages:	418
Edition:	1st ed. 1993. 2nd corr. printing 1996
ISBN-13:	978-3-540-56850-6
Categories:	Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Calculus of variations Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN:	3-540-56850-6
Barcode:	9783540568506

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!