Betts J.T. — Practical Methods for Optimal Control Using Nonlinear Programming :: Электронная библиотека попечительского совета мехмата МГУ

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

Авторизация

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

Betts J.T. — Practical Methods for Optimal Control Using Nonlinear Programming

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

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

Название: Practical Methods for Optimal Control Using Nonlinear Programming

Автор: Betts J.T.

Аннотация:

The focus is on practical methods, i.e., methods that the author has found to actually work. Everything described in the book has been implemented in production software and used to solve real problems.

Язык:

Рубрика: Computer science/

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

ed2k: ed2k stats

Издание: 1 edition

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

Active set strategy      16
Adjoint equations      82
Adjoint or costate variables      81
Augmented Lagrangian function      22
Backward Euler method      69
BFGS update      11
Bolza, problem of      89
boundary conditions      62
Boundary value problem      62
Broyden update      11
Calculus of variations      81
Collocation      85
Collocation method      68
Continuous functions      88
Control equations      82
control variable      69 87 88
Control variable equality constraint      83
Convergence, quadratic      3
Convergence, superlinear      5
Curvature      9
DAE      69
DAE index      72
Defect      64 84
Defective subproblem      47 48
DFP update      11
Differential-algebraic equation      69
Direct method      85
Directional derivative      9
Dynamic system      61
Euler Lagrange equations      82
Event      76
Filter      26
Forward communication      177
Forward difference      78
Function error      77
Function generator      76 177
Gerschgorin bound      44
Globalization strategies      20
Grid refinement      109
Hamiltonian      82
Hermite Simpson (separated)      100
Hermite — Simpson (compressed)      68 91 99
Hessian of the Lagrangian      13
Index reduction      72 83 129 172
Index sets      38
Index-one DAE      72
Indirect method      85
Inertia      45
Initial conditions      62
Initial value problem      62
Integration stepsize      66
Iteration matrix      123
k-stage Runge-Kutta      66 102
Karush — Kuhn — Tucker system      15
KKT system      15
Lagrange multipliers      13
Lagrange, problem of      89 123
Lagrangian      13
Least distance program      49
Levcnberg parameter      25 44
Limited memory update      12 38

Line search      22
Linear programming      19
Linkage conditions      76
Lobatto methods      68
Mass matrix      171
Mayer, problem of      89 123
Mesh refinement      109
Method of lines      106
Midpoint rule      69
Minimax problems      34
Minimum curvature spline      142
Multibody system      165 170
Multifrontal algorithm      42
Multiple shooting      64 76 161
Multistep methods      66 70
Newton's method, univariate optimization      5
Newton's method, univariate root finding      2
Nonlinear least squares      56
Nonlinear programming      27—28
Normal matrix      57
One-step methods      66
Optimal control problem      61
Ordinary differential equations      61
Parallel shooting      65
Parameters      87
Path constraints      82 87
Penalty function methods      22
Phase      76 87
Point functions      88
Pointwise quasi-Newton updates      38
Pontryagin maximum principle      82
Projected gradient      14
Projected Hessian      14
Quadratic penalty function      22
Quadratic programming      17
Quadrature functions      88 123
Quasi-Newton method      10—12 see
Residual Hessian      57
Residual Jacobian      56
Residuals      56
Reverse communication      177
Schur-complement      41
Secant method      3—5
Semi-explicit differential-algebraic equation      69
Sequential quadratic programming      28
Shooting method      62 76 157
Singular arc      83
Singular perturbation      70
Sparsity template      97 103
SRI update      11
State equations      87
State variable      69 87 88
State variable constraint      83
Stiff      69
Symmetric rank-one update      11
Tabular data      140
Transcription method      61 107
Transversality conditions      82
Trapezoidal method      67 91 93
Trust region      22
Two-point boundary value problem      82

О проекте