𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A hypoquadratic convergence method for Lagrange multipliers

✍ Scribed by T. Altman; P.F. Boulos


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
399 KB
Volume
27
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A unified framework for accelerating the
✍ Charbel Farhat; Po-Shu Chen; Franck Risler; Francois-Xavier Roux πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 348 KB πŸ‘ 1 views

The FETI algorithms are a family of numerically scalable substructuring methods with Lagrange multipliers that have been designed for solving iteratively large-scale systems of equations arising from the ΓΏnite element discretization of structural engineering, solid mechanics, and structural dynamics

A Modified Augmented Lagrange Multiplier
✍ Liang, Ximing ;Hu, Jianbo ;Zhong, Weitao ;Qian, Jixin πŸ“‚ Article πŸ“… 2008 πŸ› Curtin University of Technology 🌐 English βš– 486 KB πŸ‘ 2 views

## Abstract A modified augmented Lagrange multiplier method for large‐scale nonlinear optimization problem is studied in this paper. The basic steps of the proposed algorithm comprise an outer iteration, in which the Lagrange multipliers and various penalty parameters are updated, and an inner iter

A novel Lagrange-multiplier based method
✍ M.L. Parks; L. Romero; P. Bochev πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 751 KB

We propose a novel Lagrange-multiplier method for mesh tying in R 2 that passes a linear patch test for subdomains with non-coincident interfaces. This capability is required in contact problems and finite element analysis of complex bodies that were broken into simpler shapes to aid grid generation

A Lagrange multiplier decomposition meth
✍ Jonas Koko πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 225 KB

We study a Lagrange multiplier based non-overlapping domain decomposition method for the nonlinear over-pressure equation. Using an additional unknown, the problem is restated as a linearly constrained minimization problem. The resulting Uzawa-type algorithm requires at each iteration the solution o