✦ LIBER ✦

A convergent gradient method for matrix eigenvector-eigentuple problems

✍ Scribed by E. K. Blum; A. R. Curtis

Publisher: Springer-Verlag
Year: 1978
Tongue: English
Weight: 699 KB
Volume: 31
Category: Article
ISSN: 0029-599X
DOI: 10.1007/bf01397878

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Numerical solution of eigentuple-eigenve

Numerical solution of eigentuple-eigenvector problems in Hilbert spaces by a gradient method

✍ E. K. Blum; P. B. Geltner 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 674 KB

Convergence of gradient methods for opti

Convergence of gradient methods for optimal control problems

✍ S. J. Leese 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 456 KB

Global Convergence of a Modified Gradien

Global Convergence of a Modified Gradient Projection Method for Convex Constrained Problems

✍ Qing-ying Sun; Chang-yu Wang; Zhen-jun Shi 📂 Article 📅 2006 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 229 KB

Conjugate gradient method for the linear

Conjugate gradient method for the linear complementarity problem with -matrix

✍ Dong-Hui Li; Yi-Yong Nie; Jin-Ping Zeng; Qing-Na Li 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 267 KB

In this paper, we present a conjugate gradient method for solving the linear complementarity problem that involves an S-matrix. At each step, we solve a lower-dimensional system of linear equations by conjugate gradient method. The method terminates at the exact solution of the problem after a finit

A convergent decomposition method for bo

A convergent decomposition method for box-constrained optimization problems

✍ Andrea Cassioli; Marco Sciandrone 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 167 KB

A globally convergent Newton method for

A globally convergent Newton method for convex SC1minimization problems

✍ J. S. Pang; L. Qi 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 696 KB