Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Bonnans F.J., Gilbert C.J., Lemarechal C. — Numerical Optimization
Bonnans F.J., Gilbert C.J., Lemarechal C. — Numerical Optimization



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Numerical Optimization

Авторы: Bonnans F.J., Gilbert C.J., Lemarechal C.

Аннотация:

Numerical Optimization has numerous applications in engineering sciences, operations research, economics, finance, etc. Starting with illustrations of this ubiquitous character, this book is essentially devoted to numerical algorithms for optimization, which are exposed in a tutorial way. It covers fundamental algorithms as well as more specialized and advanced topics for unconstrained and constrained problems. The theoretical bases of the subject, such as optimality conditions, Lagrange multipliers or duality, although recalled, are assumed known. Most of the algorithms described in the book are explained in a detailed manner, allowing straightforward implementation. This level of detail is intended to familiarize the reader with some of the crucial questions of numerical optimization: how algorithms operate, why they converge, difficulties that may be encountered and their possible remedies. Theoretical aspects of the approaches chosen are also addressed with care, often using minimal assumptions.


Язык: en

Рубрика: Математика/Оптимизация и управление/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2003

Количество страниц: 418

Добавлена в каталог: 22.04.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Sequential quadratic programming, line-search SQP      238
Sequential quadratic programming, local      205
Sequential quadratic programming, truncated (TSQP)      251
Set, convex      26
Set, feasible or admissible      153 291 310
Set, feasible or admissible, perturbed      346
Set-valued map      see "Multifunction"
Simulator      10 16 37 67
Slater      139 142 161
Slice      25
Solution      see also "Existence uniqueness" 159 291
Solution, global      14 159
Solution, local      26 82 159
Solution, primal-dual      161
Solution, strict local      159
Solution, strong      163
SQP      see "Sequential quadratic programming"
Stabilization principle      12 30 37 117
Standard form of a linear complementarity problem      314
Standard form of linear constraints      291
State constraint      9
State equation      7
State equation, adjoint      16
State variable      7
Stationary      see "Point"
Step, null      118
Step, serious      118
Stepsize optimal      30
Stopping test      34 41
Stopping test formal      103
Stopping test, implementable      112 118 126
Subdifferential      96
Subdifferential, approximate      106
Subgradient      96
Submersion      153
Trap of nonsmooth optimization      101
Trust region      53 84 87 118 120
Uniqueness of solution      159
Update criterion      281
Value      291
Variable, control, decision      3 178
Variable, dual      98
Variable, state      178
Weak duality      see "Duality"
Wolfe      58 63 65 75 83 85 87
Wolfe conditions generalized      276
Wolfe duality      300
Zigzag      31 104 105 110
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте