Convex Analysis and Minimization Algorithms I
Produktnummer:
18ff324499438f4863b5e5bbb64caab93b
Autor: | Hiriart-Urruty, Jean-Baptiste Lemarechal, Claude |
---|---|
Themengebiete: | Convex Analysis Mathematical Programming Nonsmooth Optimization Numerical Algorithms algorithms operations research optimization |
Veröffentlichungsdatum: | 21.10.1993 |
EAN: | 9783540568506 |
Sprache: | Englisch |
Seitenzahl: | 418 |
Produktart: | Gebunden |
Verlag: | Springer Berlin |
Untertitel: | Fundamentals |
Produktinformationen "Convex Analysis and Minimization Algorithms I"
Convex Analysis may be considered as a refinement of standard calculus, with equalities and approximations replaced by inequalities. As such, it can easily be integrated into a graduate study curriculum. Minimization algorithms, more specifically those adapted to non-differentiable functions, provide an immediate application of convex analysis to various fields related to optimization and operations research. These two topics making up the title of the book, reflect the two origins of the authors, who belong respectively to the academic world and to that of applications. Part I can be used as an introductory textbook (as a basis for courses, or for self-study); Part II continues this at a higher technical level and is addressed more to specialists, collecting results that so far have not appeared in books.

Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen