| 書(shū)目名稱(chēng) | The Linearization Method for Constrained Optimization | | 編輯 | Boris N. Pshenichnyj | | 視頻video | http://file.papertrans.cn/914/913128/913128.mp4 | | 叢書(shū)名稱(chēng) | Springer Series in Computational Mathematics | | 圖書(shū)封面 |  | | 描述 | Techniques of optimization are applied in many problems in economics, automatic control, engineering, etc. and a wealth of literature is devoted to this subject. The first computer applications involved linear programming problems with simp- le structure and comparatively uncomplicated nonlinear pro- blems: These could be solved readily with the computational power of existing machines, more than 20 years ago. Problems of increasing size and nonlinear complexity made it necessa- ry to develop a complete new arsenal of methods for obtai- ning numerical results in a reasonable time. The lineariza- tion method is one of the fruits of this research of the last 20 years. It is closely related to Newton‘s method for solving systems of linear equations, to penalty function me- thods and to methods of nondifferentiable optimization. It requires the efficient solution of quadratic programming problems and this leads to a connection with conjugate gra- dient methods and variable metrics. This book, written by one of the leading specialists of optimization theory, sets out to provide - for a wide readership including engineers, economists and optimization specialists, from graduate student le | | 出版日期 | Book 1994 | | 關(guān)鍵詞 | Newton‘s method; Newtonsches Verfahren; Optimierung von Algorithmen; Straffunktion; algorithm; algorithms | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-642-57918-9 | | isbn_softcover | 978-3-642-63401-7 | | isbn_ebook | 978-3-642-57918-9Series ISSN 0179-3632 Series E-ISSN 2198-3712 | | issn_series | 0179-3632 | | copyright | Springer-Verlag Berlin Heidelberg 1994 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-26 02:24
發(fā)表于 2025-3-21 18:50:38
