Please use this identifier to cite or link to this item:
https://thuvienso.bvu.edu.vn/handle/TVDHBRVT/15614Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lindahl, Lars-Åke | - |
| dc.date.accessioned | 2016-12-08T03:10:52Z | - |
| dc.date.available | 2016-12-08T03:10:52Z | - |
| dc.date.issued | 2016 | - |
| dc.identifier.citation | 1st edition | vi |
| dc.identifier.isbn | 9788740313840 | - |
| dc.identifier.uri | http://thuvienso.bvu.edu.vn/handle/TVDHBRVT/15614 | - |
| dc.description.abstract | This third and final part of Convexity and Optimization discusses some optimization methods which, when carefully implemented, are efficient numerical optimization algorithms. We begin with a very brief general description of descent methods and then proceed to a detailed study of Newton's method. One chapter is devoted to self-concordant functions, and the convergence rate of Newton's method when applied to self-concordant functions is studied. We conclude by studying of the complexity of LP-problems. | vi |
| dc.language.iso | en | vi |
| dc.publisher | bookboon.com | vi |
| dc.subject | Optimization | vi |
| dc.subject | Tối ưu hóa | vi |
| dc.title | Descent and Interior-point Methods: Convexity and Optimization – Part III - eBooks and textbooks from bookboon.com | vi |
| dc.type | Book | vi |
| Appears in Collections: | Calculus (bookboon.com) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Descent-and-Interior-point-Methods.pdf | 4,47 MB | Adobe PDF |  Sign in to read |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.