Convex Analysis and Minimization Algorithms I: Fundamentals (Grundlehren der mathematischen Wissenschaften, 305)

Hiriart-Urruty, Jean-Baptiste; Lemarechal, Claude

ISBN 10: 3540568506 / ISBN 13: 9783540568506

Editore: Springer, 1993

Riguardo questo articolo

Yellow boards, bright pages, unmarked text, sturdy binding, like new feel all around. Codice articolo 003263

Dati bibliografici

Titolo: Convex Analysis and Minimization Algorithms ...

Casa editrice: Springer

Data di pubblicazione: 1993

Legatura: Hardcover

Condizione: Fine

Descrizione articolo

Riassunto:

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.

Recensione:

From the reviews: "... The book is very well written, nicely illustrated, and clearly understandable even for senior undergraduate students of mathematics... Throughout the book, the authors carefully follow the recommendation by A. Einstein: 'Everything should be made as simple as possible, but not simpler.'"