Parallel method of conjugate directions for minimization

Fridrich Sloboda

Aplikace matematiky (1975)

  • Volume: 20, Issue: 6, page 436-446
  • ISSN: 0862-7940

How to cite

top

Sloboda, Fridrich. "Parallel method of conjugate directions for minimization." Aplikace matematiky 20.6 (1975): 436-446. <http://eudml.org/doc/14934>.

@article{Sloboda1975,
author = {Sloboda, Fridrich},
journal = {Aplikace matematiky},
language = {eng},
number = {6},
pages = {436-446},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Parallel method of conjugate directions for minimization},
url = {http://eudml.org/doc/14934},
volume = {20},
year = {1975},
}

TY - JOUR
AU - Sloboda, Fridrich
TI - Parallel method of conjugate directions for minimization
JO - Aplikace matematiky
PY - 1975
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 20
IS - 6
SP - 436
EP - 446
LA - eng
UR - http://eudml.org/doc/14934
ER -

References

top
  1. N. Adachi, 10.1007/BF00931977, JOTA, б (1971), 391-410. (1971) Zbl0203.48703MR0293814DOI10.1007/BF00931977
  2. H. Y. Huang, Unified approach to quadratically convergent algorithms for minimization, JOTA, б (1970), 405-423. (1970) Zbl0184.20202MR0288939
  3. R. Fletcher M. J. D. Powell, A rapidly convergent descent method for minimization, Соmр. J., 2 (1963), 163-168. (1963) Zbl0132.11603MR0152116
  4. M. R. Hestenes E. Stiefel, 10.6028/jres.049.044, J. Res. Nat. Bur. Standards 49 (1952), 409-436. (1952) Zbl0048.09901MR0060307DOI10.6028/jres.049.044
  5. R. Fletcher C. M. Reeves, Function minimization by conjugate gradients, Соmр. J. 2., (1964), 149-154. (1964) Zbl0132.11701MR0187375
  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. (1964) Zbl0132.11702MR0187376
  7. W. I. Zangwill, Minimizing a function without calculating derivatives, Com. J., 7 (1967), 293-296. (1967) Zbl0189.48004MR0234614
  8. D. Chazan W. L. Miranker, A nongradient and parallel algorithm for unconstrained minimization, SIAM J. Control. 2 (1970), 207-217. (1970) Zbl0223.65022MR0275637
  9. W. W. Bradbury R. Fletcher, 10.1007/BF02162089, Numer. Math., 9 (1966), 259-267. (1966) Zbl0202.43502MR0219230DOI10.1007/BF02162089
  10. R. Bellman R. Kalaba J. Lockett, Dynamic programming and ill-conditioned linear systems, J. of Math. Analysis and Applicat., 10 (1065), 206-215. Zbl0128.39302MR0171377
  11. E. J. Beltrami, An algorithmic approach to nonlinear analysis and optimization, Academic Press, New York, 1970. (1970) Zbl0207.17202MR0270538
  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. (1970) Zbl0197.42802MR0272164
  13. J. Céa, Optimization théorie et algorithmes, Dunad, Paris, 1971. (1971) Zbl0211.17402
  14. D. M. Himmelblau, Decomposition of large-scale problems, North-Holl. publ. соmр., New York, 1973. (1973) Zbl0254.90002MR0456435
  15. F. Sloboda, Parallel projection method for linear algebraic systems, to appear. Zbl0398.65013MR0428695

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.