Home Book reviews Contact

DISCLOSURE: When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.

Please share to

2 titles, showing 1-2 sort by PRICE ASC.
Please follow us on AddALL Facebook page twitter page
TITLE

SORT

change title size:
AUTHOR

SORT

change author size:
PRICE

DEALER / SITE

SORT

DESCRIPTION

 

change description size:
Claude Lemaréchal
author size:
USD
71.42
price size:
AHA-BUCH GmbH /ZVAB
dealer size:
ISBN10: 3540422056, ISBN13: 9783540422051, [publisher: Springer Berlin Heidelberg] Softcover Druck auf Anfrage Neuware - Printed after ordering - 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], ...
Show/Hide image
description size:
Claude Lemaréchal
author size:
USD
78.91
price size:
AHA-BUCH GmbH /AbebooksDE
dealer size:
ISBN10: 3540422056, ISBN13: 9783540422051, [publisher: Springer Berlin Heidelberg] Softcover Druck auf Anfrage Neuware - Printed after ordering - 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], ...
Show/Hide image
description size:

DISCLOSURE: When you use one of our links to make a purchase, we may earn a commission at no extra cost to you.
As an Amazon Associate, AddALL earn commission from qualifying Amazon purchases.


TOO Many Search Results? Refine it!
Exclude: (what you don't want)
Include: (what you want)
Search Results Sort By:
240426194157946192