Fundamentals of Convex Analysis : Based on Volume 305 and 306 in the Series: "Grundlehren Der Mathematischenwissenschaften", 1993

Lemarechal, Claude; Chenciner, A. (EDT); Chern, S. S. (EDT); Eckmann, B. (EDT); Harpe, P. De LA (EDT); Hirzebruch, F. (EDT); Hitchin, N. (EDT); Hormander, L. (EDT); Knus, M. A. (EDT); Kupiainen, A. (EDT); Lebeau, G. (EDT); Ratner, M. (EDT); Serre, D. (EDT); Urruty, J. B. Hiriart

ISBN 10: 3540422056 / ISBN 13: 9783540422051

Published by Springer, 2001

About this Item

Seller Inventory # 915995-n

Bibliographic Details

• Title: Fundamentals of Convex Analysis : Based on Volume 305 and 306 in the Series: "Grundlehren Der Mathematischenwissenschaften", 1993
• Publisher: Springer
• Publication Date: 2001
• Language: English
• ISBN 10: 3540422056
• ISBN 13: 9783540422051
• Binding: Hardcover
• Condition: New

About this title

Synopsis

This book is an abridged version of our two-volume opus Convex Analysis and Minimization Algorithms [18], about which we have received very positive feedback from users, readers, lecturers ever since it was published - by Springer-Verlag in 1993. Its pedagogical qualities were particularly appreciated, in the combination with a rather advanced technical material. Now [18] hasa dual but clearly defined nature: - an introduction to the basic concepts in convex analysis, - a study of convex minimization problems (with an emphasis on numerical al- rithms), and insists on their mutual interpenetration. It is our feeling that the above basic introduction is much needed in the scientific community. This is the motivation for the present edition, our intention being to create a tool useful to teach convex anal­ ysis. We have thus extracted from [18] its "backbone" devoted to convex analysis, namely ChapsIII-VI and X. Apart from some local improvements, the present text is mostly a copy of thecorresponding chapters. The main difference is that we have deleted material deemed too advanced for an introduction, or too closely attached to numerical algorithms. Further, we have included exercises, whose degree of difficulty is suggested by 0, I or 2 stars *. Finally, the index has been considerably enriched. Just as in [18], each chapter is presented as a "lesson", in the sense of our old masters, treating of a given subject in its entirety.

Review

From the reviews of the first edition:

"...This book is an abridged version of the book "Convex Analysis and Minimization Algorithms" (shortly CAMA) written in two volumes by the same authors... . The authors have extracted from CAMA Chapters III-VI and X, containing the fundamentals of convex analysis, deleting material seemed too advanced for an introduction, or too closely attached to numerical algorithms. Each Chapter is presented as a "lesson" treating a given subject in its entirety, completed by numerous examples and figures. So, this new version becomes a good book for learning and teaching of convex analysis in finite dimensions...."

S. Mititelu in "Zentralblatt für Mathematik und ihre Grenzgebiete", 2002

"I believe that the book under review will become the standard text doing much to implement the type of course Victor Klee was advocating and covering as it does the considerable recent development of the subject. ... If you are looking for a well-designed text for a course on convex analysis, preliminary to one on optimization or nonlinear analysis then this is the one which will certainly be a standard for many years." (John Giles, The Australian Mathematical Society Gazette, Vol. 29 (2), 2002)