| 書(shū)目名稱 | Convex Analysis and Minimization Algorithms I |
| 副標(biāo)題 | Fundamentals |
| 編輯 | Jean-Baptiste Hiriart-Urruty,Claude Lemaréchal |
| 視頻video | http://file.papertrans.cn/238/237826/237826.mp4 |
| 叢書(shū)名稱 | Grundlehren der mathematischen Wissenschaften |
| 圖書(shū)封面 |  |
| 描述 | 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. |
| 出版日期 | Book 1993 |
| 關(guān)鍵詞 | Convex Analysis; Mathematical Programming; Nonsmooth Optimization; Numerical Algorithms; algorithms; oper |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-662-02796-7 |
| isbn_softcover | 978-3-642-08161-3 |
| isbn_ebook | 978-3-662-02796-7Series ISSN 0072-7830 Series E-ISSN 2196-9701 |
| issn_series | 0072-7830 |
| copyright | Springer-Verlag Berlin Heidelberg 1993 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-16 19:41
發(fā)表于 2025-3-21 18:26:18
