Limit this search to....

Fundamentals of Convex Analysis 2001. Corr. 2nd Edition
Contributor(s): Hiriart-Urruty, Jean-Baptiste (Author), Lemaréchal, Claude (Author)
ISBN: 3540422056     ISBN-13: 9783540422051
Publisher: Springer
OUR PRICE:   $66.49  
Product Type: Paperback
Published: September 2001
Qty:
Annotation: This book is an abridged version of the two volumes "Convex Analysis and Minimization Algorithms I and II" (Grundlehren der mathematischen Wissenschaften Vol. 305 and 306), which presented an introduction to the basic concepts in convex analysis and a study of convex minimization problems. The "backbone" of both volumes was extracted, some material deleted that was deemed too advanced for an introduction, or too closely related to numerical algorithms. Some exercises were included and finally the index has been considerably enriched.
The main motivation of the authors was to "light the entrance" of the monument Convex Analysis. This book is not a reference book to be kept on the shelf by experts who already know the building and can find their way through it; it is far more a book for the purpose of learning and teaching.
Additional Information
BISAC Categories:
- Mathematics | Calculus
- Mathematics | Linear & Nonlinear Programming
- Mathematics | Applied
Dewey: 515.8
LCCN: 2001053271
Series: Lecture Notes in Artificial Intelligence
Physical Information: 0.57" H x 6.14" W x 9.21" (0.85 lbs) 259 pages
 
Descriptions, Reviews, Etc.
Publisher Description:
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 the corresponding 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.