Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes
- Volume: 11, Issue: 1, page 61-74
- ISSN: 0764-583X
Access Full Article
topHow to cite
topMeyer, Gérard G. L.. "Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes." ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique 11.1 (1977): 61-74. <http://eudml.org/doc/193288>.
@article{Meyer1977,
author = {Meyer, Gérard G. L.},
journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique},
language = {fre},
number = {1},
pages = {61-74},
publisher = {Dunod},
title = {Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes},
url = {http://eudml.org/doc/193288},
volume = {11},
year = {1977},
}
TY - JOUR
AU - Meyer, Gérard G. L.
TI - Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes
JO - ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
PY - 1977
PB - Dunod
VL - 11
IS - 1
SP - 61
EP - 74
LA - fre
UR - http://eudml.org/doc/193288
ER -
References
top- 1. W. W. HOGAN, Point-to-Set Maps in Mathematical Programming, S.I.A.M.Rev.t vol. 15, 1973, p. 591-603. Zbl0256.90042MR345641
- 2. P. HUARD, Algorithmes d'optimisation et fonctions multivoques, E.D.F., Bulletinde la Direction des Études et Recherches, Série C, vol. 2, 1972, p. 43-62. MR378823
- 3. P. HUARD, Tentatives de synthèse dans les méthodes de programmation nonlinéaires, Cahiers Centre Études Recherche Opér., vol. 16, 1974, p. 347-368. Zbl0298.90053MR368779
- 4. P. HUARD, Optimization Algorithms and Point-to-Set Mapping, Math. Program-ming, vol. 8, 1975, p. 308-331. Zbl0312.90052MR371413
- 5. J. L. KEIXEY, General Topology, D. Van Nostrand Company, Inc., 1955. MR70144
- 6. D. G. LUENBERGER, Introduction to Linear and Non Linear Programming, Addison-Wesley Publishing Co., 1973. Zbl0297.90044
- 7. G. G. L. MEYER et E. POLAK, Abstract Models for the Synthesis of Optimization Algorithms, S.I.A.M. J. Controi, voi. 9, 1971, p. 547-560. Zbl0209.16704MR307472
- 8. G. G. L. MEYER, Algorithm Model for Penalty Functions Type Iterative Procedures, J. Comput. System ScL, vol. 9, 1974, p. 20-30. Zbl0298.65043MR345642
- 9. G. G. L. MEYER, A Canonical Structure for Iterative Procedures, J. Math. Anal.Appl., vol. 52, 1975, p. 120-128. Zbl0322.65032MR383819
- 10. G. G. L. MEYER, A Systematic Approach to the Synthesis of Algorithms, Numer.Math., vol. 24, 1975, p. 277-289. Zbl0323.65022MR403218
- 11. E. POLAK, On the Convergence of Optimization Algorithms, Rev. Fr. Inform.Rech. Opération., vol. 16, 1969, p. 17-34. Zbl0174.47906MR248968
- 12. E. POLAK, Computational Methods in Optimization : A Unified Approach, Academic Press, 1971. MR282511
- 13. B. T. POLYAK, Gradient Methods for the Minimisation of Functionals, U.S.S.R.Computational Math, and Math. Phys., vol. 3, 1963, p. 864-878 (Translationof Z. Vycisl. Mat. i Mat. Fiz., vol. 3, 1963, p. 643-653). Zbl0196.47701MR158568
- 14. W. L ZANGWILL, Non-Linear Programming: A Unified Approach, Prentice Hall, 1969. Zbl0195.20804
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.