Abstract
AbstractIn this paper we will present a review of recent advances in the application of the augmented Lagrange multiplier method as a general approach for generating multiplier-free stabilised methods. The augmented Lagrangian method consists of a standard Lagrange multiplier method augmented by a penalty term, penalising the constraint equations, and is well known as the basis for iterative algorithms for constrained optimisation problems. Its use as a stabilisation methods in computational mechanics has, however, only recently been appreciated. We first show how the method generates Galerkin/Least Squares type schemes for equality constraints and then how it can be extended to develop new stabilised methods for inequality constraints. Application to several different problems in computational mechanics is given.
Funder
Vetenskapsrådet
Engineering and Physical Sciences Research Council
Jönköping University
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference114 articles.
1. Hestenes MR (1969) Multiplier and gradient methods. J Optim Theory Appl 4:303–320
2. Powell MJD (1969) A method for nonlinear constraints in minimization problems. In Optimization (Sympos., Univ. Keele, Keele, 1968), pp 283–298. Academic Press, London
3. Rockafellar RT (1973) A dual approach to solving nonlinear programming problems by unconstrained optimization. Math Program 5:354–373
4. Rockafellar RT (1973) The multiplier method of Hestenes and Powell applied to convex programming. J Optim Theory Appl 12:555–562
5. Glowinski R, Marrocco A (1975) Sur l’approximation, par éléments finis d’ordre un, et la résolution, par pénalisation-dualité, d’une classe de problèmes de Dirichlet non linéaires. Rev. Française Automat. Informat. Rech Opér Sér Rouge Anal Numér 9(R-2):41–76
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献