Solving Unconstrained Discrete-time Optimal Control Problems Using Trust Region Method |
From inside the book
3 pages matching Computing Research Institute in this book
Page 1
Where's the rest of this book?
Results 1-3 of 3
Common terms and phrases
Advanced Computing Research Algorithm I Algorithm Algorithm subP Applying Algorithm approximate solution barrier function C-L Algorithm c₁ calculating the Newton Coleman and Liao Computing Research Institute constrained DTOC problem Cornell Theory Center CORNELL UNIVERSITY discrete-time optimal control eigenvalue eigenvector Əyi Fadil Santosa finite many iterations H is positive H-¹g H+ XI H₁ H₂ Hessian identity matrix inverse power method Iter Iter(Feva iteration of Algorithm j-th component Lemma Li)z Liao 13 limit point line searches LN(YN matrix method for solving Moré 16 Moré and Sorensen Newton's method number of iterations Numerical results optimal control problems Pantoja's procedure positive definite positive semidefinite pure trust region quadratic results for problem satisfies solution of subP Solve subP solving the trust Sorensen 17 Ti(Yi Ti)y Ti)z total number trust region algorithms trust region method trust region subproblem unconstrained discrete-time optimal update vector Wei Yuan y₁ Yi+1 Yuying λ₁ მე