Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes
Meyer, Gérard G. L.
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique, Tome 11 (1977), p. 61-74 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1977-01-01
@article{M2AN_1977__11_1_61_0,
     author = {Meyer, G\'erard G. L.},
     title = {Conditions de convergence pour les algorithmes it\'eratifs monotones, autonomes et non d\'eterministes},
     journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Mod\'elisation Math\'ematique et Analyse Num\'erique},
     volume = {11},
     year = {1977},
     pages = {61-74},
     mrnumber = {451717},
     zbl = {0382.65027},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/M2AN_1977__11_1_61_0}
}

Meyer, 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, Tome 11 (1977) pp. 61-74. http://gdmltest.u-ga.fr/item/M2AN_1977__11_1_61_0/

1. W. W. Hogan, Point-to-Set Maps in Mathematical Programming, S.I.A.M.Rev.t vol. 15, 1973, p. 591-603. | MR 345641 | Zbl 0256.90042

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. | MR 378823

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. | MR 368779 | Zbl 0298.90053

4. P. Huard, Optimization Algorithms and Point-to-Set Mapping, Math. Program-ming, vol. 8, 1975, p. 308-331. | MR 371413 | Zbl 0312.90052

5. J. L. Keixey, General Topology, D. Van Nostrand Company, Inc., 1955. | MR 70144

6. D. G. Luenberger, Introduction to Linear and Non Linear Programming, Addison-Wesley Publishing Co., 1973. | Zbl 0297.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. | MR 307472 | Zbl 0209.16704

8. G. G. L. Meyer, Algorithm Model for Penalty Functions Type Iterative Procedures, J. Comput. System ScL, vol. 9, 1974, p. 20-30. | MR 345642 | Zbl 0298.65043

9. G. G. L. Meyer, A Canonical Structure for Iterative Procedures, J. Math. Anal.Appl., vol. 52, 1975, p. 120-128. | MR 383819 | Zbl 0322.65032

10. G. G. L. Meyer, A Systematic Approach to the Synthesis of Algorithms, Numer.Math., vol. 24, 1975, p. 277-289. | MR 403218 | Zbl 0323.65022

11. E. Polak, On the Convergence of Optimization Algorithms, Rev. Fr. Inform.Rech. Opération., vol. 16, 1969, p. 17-34. | Numdam | MR 248968 | Zbl 0174.47906

12. E. Polak, Computational Methods in Optimization : A Unified Approach, Academic Press, 1971. | MR 282511

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). | MR 158568 | Zbl 0196.47701

14. W. L Zangwill, Non-Linear Programming: A Unified Approach, Prentice Hall, 1969. | Zbl 0195.20804