Interior-point polynomial algorithms in convex programming / Yurii nesterov and arkadii nemirovskii
Material type:
TextSeries: SIAM studies in applied mathematicsPublication details: Philadelphia : Siam, 1994.Edition: 1a edDescription: 405 p. : 26 cmISBN: - 0898713196
- QA402.5 N47 1994
| Item type | Current library | Call number | Copy number | Status | Notes | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|
Libro
|
Biblioteca de la Facultad de Físico Matemáticas General | QA402.5 N47 1994 C:1 (Browse shelf(Opens below)) | C:1 | Available | Solo para Lectura | FFM000008848 |
Browsing Biblioteca de la Facultad de Físico Matemáticas shelves, Shelving location: General Close shelf browser (Hides shelf browser)
| QA402.5 M63 2000 C:1 A set of examples of global and discrete optimization : applications of Bayesian Heuristic Approach / | QA402.5 M67 1994 C:1 Optimization software guide / | QA402.5 M67 1994 C:2 Optimization software guide / | QA402.5 N47 1994 C:1 Interior-point polynomial algorithms in convex programming / | QA402.5 N47 2004 C:1 Introductory lectures on convex optimization : | QA402.5 N86 2000 C:1 Numerical Optimization: Theoretical and Practical Aspects | QA402.5 O68 2001 C:1 Optimization and related topics / |
Incluye apéndice, bibliografía e índice
There are no comments on this title.
Log in to your account to post a comment.