✦ LIBER ✦

A class of superlinearly convergent projection algorithms with relaxed stepsizes

✍ Scribed by Berc Rustem

Publisher: Springer
Year: 1984
Tongue: English
Weight: 827 KB
Volume: 12
Category: Article
ISSN: 0095-4616
DOI: 10.1007/bf01449032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reconstructing pictures from projections

Reconstructing pictures from projections: On the convergence of the ART algorithm with relaxation

✍ M. R. Trummer 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 279 KB

On a class of minimization algorithms wi

On a class of minimization algorithms with over-linear convergence

✍ Yu.M. Danilin 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 759 KB

Convergence of a strong variational algo

Convergence of a strong variational algorithm for relaxed controls involving a class of hyperbolic systems

✍ K. L. Teo; D. J. Clements; Z. S. Wu; K. G. Choo 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 791 KB

On the convergence of a certain class of

On the convergence of a certain class of iterative procedures under relaxed conditions with applications

✍ Ioannis K. Argyros 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 552 KB

We provide sufficient convergence conditions for a certain class of inexact Newton-like methods to a locally unique solution of a nonlinear equation in a Banach space. The equation contains a nondifferentiable term and at each step we use the inverse of the same linear operator. We use Ptak-like con

Global Convergence of a Class of Colline

Global Convergence of a Class of Collinear Scaling Algorithms with Inexact Line Searches on Convex Functions

✍ K. A. Ariyawansa; N. Begashaw 📂 Article 📅 1999 🏛 Springer Vienna 🌐 English ⚖ 180 KB

An analog of Karmarkar's algorithm for i

An analog of Karmarkar's algorithm for inequality constrained linear programs, with a ‘new’ class of projective transformations for centering a polytope

✍ Robert M Freund 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 491 KB