Geodesic
Parallel method of conjugate directions for minimization
Applications of Mathematics, Tome 20 (1975) no. 6, pp. 436-446
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

A nongradient method of conjugate directions for minimization id described. The method has the quadratic convergence property and is closely related to the method for linear systems, which makes it possible to use reduced algorithms when the corresponding matrix is sparse.
A nongradient method of conjugate directions for minimization id described. The method has the quadratic convergence property and is closely related to the method for linear systems, which makes it possible to use reduced algorithms when the corresponding matrix is sparse.
DOI : 10.21136/AM.1975.103611
Classification : 65K05, 90C20 
@article{10_21136_AM_1975_103611,
     author = {Sloboda, Fridrich},
     title = {Parallel method of conjugate directions for minimization},
     journal = {Applications of Mathematics},
     pages = {436--446},
     year = {1975},
     volume = {20},
     number = {6},
     doi = {10.21136/AM.1975.103611},
     mrnumber = {0395830},
     zbl = {0326.90050},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1975.103611/}
}
TY  - JOUR
AU  - Sloboda, Fridrich
TI  - Parallel method of conjugate directions for minimization
JO  - Applications of Mathematics
PY  - 1975
SP  - 436
EP  - 446
VL  - 20
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.1975.103611/
DO  - 10.21136/AM.1975.103611
LA  - en
ID  - 10_21136_AM_1975_103611
ER  - 
%0 Journal Article
%A Sloboda, Fridrich
%T Parallel method of conjugate directions for minimization
%J Applications of Mathematics
%D 1975
%P 436-446
%V 20
%N 6
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.1975.103611/
%R 10.21136/AM.1975.103611
%G en
%F 10_21136_AM_1975_103611
Sloboda, Fridrich. Parallel method of conjugate directions for minimization. Applications of Mathematics, Tome 20 (1975) no. 6, pp. 436-446. doi: 10.21136/AM.1975.103611

[1] N. Adachi: On variable-metric algorithms. JOTA, б (1971), 391-410. | DOI | MR | Zbl

[2] H. Y. Huang: Unified approach to quadratically convergent algorithms for minimization. JOTA, б (1970), 405-423. | MR

[3] R. Fletcher M. J. D. Powell: A rapidly convergent descent method for minimization. Соmр. J., 2 (1963), 163-168. | MR

[4] M. R. Hestenes E. Stiefel: The method of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Standards 49 (1952), 409-436. | DOI | MR

[5] R. Fletcher C. M. Reeves: Function minimization by conjugate gradients. Соmр. J. 2., (1964), 149-154. | MR

[6] M. J. D. Powell: An efficient method for finding minimum of a function of several variables without calculating derivatives. Соmр. J., 7 (1964), 155-162. | MR

[7] W. I. Zangwill: Minimizing a function without calculating derivatives. Com. J., 7 (1967), 293-296. | MR | Zbl

[8] D. Chazan W. L. Miranker: A nongradient and parallel algorithm for unconstrained minimization. SIAM J. Control. 2 (1970), 207-217. | MR

[9] W. W. Bradbury R. Fletcher: New iterative methods for solution of the eigenproblern. Numer. Math., 9 (1966), 259-267. | DOI | MR

[10] R. Bellman R. Kalaba J. Lockett: Dynamic programming and ill-conditioned linear systems. J. of Math. Analysis and Applicat., 10 (1065), 206-215. | MR

[11] E. J. Beltrami: An algorithmic approach to nonlinear analysis and optimization. Academic Press, New York, 1970. | MR | Zbl

[12] H. Tokumaru N. Adachi K. Goto: Davidson's method for minimization problems in Hilbert space with an application to control problems. SIAM J. Control, 2 (1970), 163 - 178. | MR

[13] J. Céa: Optimization théorie et algorithmes. Dunad, Paris, 1971.

[14] D. M. Himmelblau: Decomposition of large-scale problems. North-Holl. publ. соmр., New York, 1973. | MR | Zbl

[15] F. Sloboda: Parallel projection method for linear algebraic systems. to appear. | MR | Zbl

Cité par Sources :