Les méthodes de «descente» dans la théorie de l'optimisation
R.I.R.O., 2 13 (1968) 79-101
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Information Systems and Data Analysis
Jan de LeeuwStudies in Classification, Data Analysis, and Knowledge Organization, Information Systems and Data Analysis 308 (1994)
https://doi.org/10.1007/978-3-642-46808-7_28
Crossing of Algorithms in Decomposition Methods
Guy PierraIFAC Proceedings Volumes 9 (3) 309 (1976)
https://doi.org/10.1016/S1474-6670(17)67353-1
An Historical Survey of Computational Methods in Optimal Control
E. PolakSIAM Review 15 (2) 553 (1973)
https://doi.org/10.1137/1015071
Brève communication. Méthode de l'état adjoint par «relaxation»
J. C. MiellouRevue française d'automatique informatique recherche opérationnelle. Mathématique 6 (R1) 81 (1972)
https://doi.org/10.1051/m2an/197206R100811
Tour d'horizon : programmation non linéaire
P. HuardRevue française d'informatique et de recherche opérationnelle. Série rouge 5 (R1) 3 (1971)
https://doi.org/10.1051/m2an/197105R100031