𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Preconditioning methods for linear systems arising in constrained optimization problems

✍ Scribed by Owe Axelsson; Maya Neytcheva

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
222 KB
Volume
10
Category
Article
ISSN
1070-5325

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Indefinitely preconditioned inexact Newt
Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems
✍ Ladislav LukΕ‘an; Jan Vlček πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 195 KB πŸ‘ 2 views

An inexact Newton algorithm for large sparse equality constrained non-linear programming problems is proposed. This algorithm is based on an indefinitely preconditioned smoothed conjugate gradient method applied to the linear KKT system and uses a simple augmented Lagrangian merit function for Armij

An inverse dynamics-based dynamic progra
An inverse dynamics-based dynamic programming method for optimal control problems of linear systems
✍ Chen-Wen V. Yen; Tsong-Zen Liu πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 83 KB πŸ‘ 1 views

In solving optimal control problems, the conventional dynamic programming method often requires interpolations to determine the optimal control law. As a consequence, interpolation errors often degenerate the accuracy of the conventional dynamic programming method. In view of this problem, this pape