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

Extended preconditioners for the FETI method applied to constrained problems

โœ Scribed by Daniel J. Rixen

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
242 KB
Volume
54
Category
Article
ISSN
0029-5981

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

A gradient-only line search method for t
A gradient-only line search method for the conjugate gradient method applied to constrained optimization problems with severe noise in the objective function
โœ J. A. Snyman ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 100 KB

A new implementation of the conjugate gradient method is presented that economically overcomes the problem of severe numerical noise superimposed on an otherwise smooth underlying objective function of a constrained optimization problem. This is done by the use of a novel gradient-only line search t