Convex Analysis and Minimization Algorithms II
Springer Berlin (Verlag)
978-3-540-56852-0 (ISBN)
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 | 21.10.1993 |
---|---|
Reihe/Serie | Grundlehren der mathematischen Wissenschaften |
Zusatzinfo | XVIII, 348 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 748 g |
Themenwelt | Mathematik / Informatik ► Mathematik ► Analysis |
Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
Wirtschaft ► Betriebswirtschaft / Management | |
Schlagworte | Algorithmen • algorithms • Analysis • Calculus • Convex Analysis • Mathhematical Programming • Nonsmooth Optimization • Numerical Algorithms • Optimization |
ISBN-10 | 3-540-56852-2 / 3540568522 |
ISBN-13 | 978-3-540-56852-0 / 9783540568520 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich