๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Symmetric approximate linear programming for factored MDPs with application to constrained problems

โœ Scribed by Dmitri A. Dolgov; Edmund H. Durfee

Publisher
Springer Netherlands
Year
2007
Tongue
English
Weight
685 KB
Volume
47
Category
Article
ISSN
1012-2443

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The FETI family of domain decomposition
The FETI family of domain decomposition methods for inequality-constrained quadratic programming: Application to contact problems with conforming and nonconforming interfaces
โœ Philip Avery; Charbel Farhat ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

Two domain decomposition methods with Lagrange multipliers for solving iteratively quadratic programming problems with inequality constraints are presented. These methods are based on the FETI and FETI-DP substructuring algorithms. In the case of linear constraints, they do not perform any Newton-li