| 書(shū)目名稱(chēng) | Optimization | | 副標(biāo)題 | Algorithms and Consi | | 編輯 | Elijah Polak | | 視頻video | http://file.papertrans.cn/704/703135/703135.mp4 | | 叢書(shū)名稱(chēng) | Applied Mathematical Sciences | | 圖書(shū)封面 |  | | 描述 | This book deals with optimality conditions, algorithms, and discretization tech- niques for nonlinear programming, semi-infinite optimization, and optimal con- trol problems. The unifying thread in the presentation consists of an abstract theory, within which optimality conditions are expressed in the form of zeros of optimality junctions, algorithms are characterized by point-to-set iteration maps, and all the numerical approximations required in the solution of semi-infinite optimization and optimal control problems are treated within the context of con- sistent approximations and algorithm implementation techniques. Traditionally, necessary optimality conditions for optimization problems are presented in Lagrange, F. John, or Karush-Kuhn-Tucker multiplier forms, with gradients used for smooth problems and subgradients for nonsmooth prob- lems. We present these classical optimality conditions and show that they are satisfied at a point if and only if this point is a zero of an upper semicontinuous optimality junction. The use of optimality functions has several advantages. First, optimality functions can be used in an abstract study of optimization algo- rithms. Second, many opti | | 出版日期 | Book 1997 | | 關(guān)鍵詞 | Newton‘s method; Optimal control; Optimality Conditions; Optimization algorithm; Optimization algorithms | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4612-0663-7 | | isbn_softcover | 978-1-4612-6861-1 | | isbn_ebook | 978-1-4612-0663-7Series ISSN 0066-5452 Series E-ISSN 2196-968X | | issn_series | 0066-5452 | | copyright | Springer-Verlag New York, Inc. 1997 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-10 15:43
發(fā)表于 2025-3-21 18:40:07
