✦ LIBER ✦

Convergence of algorithms for finding saddle points

✍ Scribed by E. A. Nurminskii; P. I. Verchenko

Publisher: Springer US
Year: 1977
Tongue: English
Weight: 415 KB
Volume: 13
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069664

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A saddle point finding algorithm for fun

A saddle point finding algorithm for functionals

✍ I. Clejan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 535 KB

We present an algorithm which can be used to find saddle points of non-linear functionals or functions with a large number of variables. The saddle points that can be found have only one unstable direction. The algorithm is tested on a "~" functional and yields the well known circular "critical drop

Convergence of approximate saddle points

✍ Jean Guillerme 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 655 KB

Conjugate-directions method for finding

Conjugate-directions method for finding saddle points

✍ Yu. M. Danilin; V. M. Panin 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 443 KB

The convergence speed of some methods of

The convergence speed of some methods of finding minimaxes and saddle points

✍ A. B. Pevnyi 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 305 KB

On convergence rate of the augmented Lag

On convergence rate of the augmented Lagrangian algorithm for nonsymmetric saddle point problems

✍ G.M. Awanou; M.J. Lai 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Residual reduction algorithms for nonsym

Residual reduction algorithms for nonsymmetric saddle point problems

✍ Constantin Bacuta; Brendan McCracken; Lu Shu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 559 KB

In this paper, we introduce and analyze Uzawa algorithms for non-symmetric saddle point systems. Convergence for the algorithms is established based on new spectral results about Schur complements. A new Uzawa type algorithm with optimal relaxation parameters at each new iteration is introduced and