Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Convex Analysis and Minimization Algorithms II - Jean-Baptiste Hiriart-Urruty, Claude Lemarechal

Convex Analysis and Minimization Algorithms II

Advanced Theory and Bundle Methods
Buch | Softcover
XVIII, 348 Seiten
2010 | 1. Softcover reprint of hardcover 1st ed. 1993
Springer Berlin (Verlag)
978-3-642-08162-0 (ISBN)
CHF 209,70 inkl. MwSt
From the reviews: "The account is quite detailed and is written in a manner that will appeal to analysts and numerical practitioners alike...they contain everything from rigorous proofs to tables of numerical calculations.... one of the strong features of these books...that they are designed not for the expert, but for those who whish to learn the subject matter starting from little or no background...there are numerous examples, and counter-examples, to back up the theory...To my knowledge, no other authors have given such a clear geometric account of convex analysis." "This innovative text is well written, copiously illustrated, and accessible to a wide audience"

In the second printing of these two volumes 305 and 306 the authors have made various local improvements and corrections, and updated the bibliography. The index has been considerably augmented and refined.

IX. Inner Construction of the Subdifferential.- X. Conjugacy in Convex Analysis.- XI. Approximate Subdifferentials of Convex Functions.- XII. Abstract Duality for Practitioners.- XIII. Methods of ?-Descent.- XIV. Dynamic Construction of Approximate Subdifferentials: Dual Form of Bundle Methods.- XV. Acceleration of the Cutting-Plane Algorithm: Primal Forms of Bundle Methods.- Bibliographical Comments.- References.

From the reviews: "The account is quite detailed and is written in a manner that will appeal to analysts and numerical practitioners alike...they contain everything from rigorous proofs to tables of numerical calculations.... one of the strong features of these books. . . [is] that they are designed not for the expert, but for those who wish to learn the subject matter starting from little or no background...there are numerous examples, and counter-examples, to back up the theory...To my knowledge, no other authors have given such a clear geometric account of convex analysis." "This innovative text is well written, copiously illustrated, and accessible to a wide audience"

From the reviews: "The account is quite detailed and is written in a manner that will appeal to analysts and numerical practitioners alike...they contain everything from rigorous proofs to tables of numerical calculations.... one of the strong features of these books. . . [is] that they are designed not for the expert, but for those who wish to learn the subject matter starting from little or no background...there are numerous examples, and counter-examples, to back up the theory...To my knowledge, no other authors have given such a clear geometric account of convex analysis." "This innovative text is well written, copiously illustrated, and accessible to a wide audience"

Erscheint lt. Verlag 1.12.2010
Reihe/Serie Grundlehren der mathematischen Wissenschaften
Zusatzinfo XVIII, 348 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 545 g
Themenwelt Mathematik / Informatik Mathematik Analysis
Mathematik / Informatik Mathematik Angewandte Mathematik
Wirtschaft Betriebswirtschaft / Management
Schlagworte algorithms • Calculus • Convex Analysis • Mathhematical Programming • Nonsmooth Optimization • Numerical Algorithms • Optimization
ISBN-10 3-642-08162-2 / 3642081622
ISBN-13 978-3-642-08162-0 / 9783642081620
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich

von Tilo Arens; Frank Hettlich; Christian Karpfinger …

Buch (2022)
Springer Spektrum (Verlag)
CHF 109,95