Abstract
It appears that the stochastic gradient method is
-
-very easy to implement
-
-very efficient
-
-easy to extend in the integer case
The main interest of this study is to show that this method may be applied in a domain which is not classical for it that is: large NP complete problems. In these cases it seems to give good heuristics.
This work has been supported by EDF Etudes et Recherches, Service Etude de réseaux, Département Methodes d'Optimisation.
Preview
Unable to display preview. Download preview PDF.
References
Robbins, H. and Monro, S. (1951) A stochastic approximation method Ann.Math.Statist.,22,400–407.
Polyak, B.T. (1976) Convergence and convergence rate of iterative stochastic algorithms. Automatica i Telemekhanika, 12,83–94.
Polyak,B.T. and Tsypkin, Y.Z. (1973). Pseudogradient adaptation and training algorithms. Automatica i Telemekhanica, 3.
Kushner,H.J. and Clork,D.S. (1976). Stochastic approximation methods for constrained and unconstrained systems. Springer Verlag.
Maurras,J.F. (1972) Flot optimal sur un graphe avec multiplicateurs.EDF Publication DER Serie C,(1)
Dodu,J.C. (1978) Modele dynamique d'optimisation a long terme d'un reseau de transport d'energie electrique. French Journal RAIRO, 12,(2).
Goursat,M.,Quadrat,J.P. and Viot,M. (1984) Report of EDF contract. INRIA.
Dodu J.C., Goursat,M.,Hertz A.,Quadrat,J.P. and Viot,M. (1981) Méthodes de gradient stochastique pour l'optimisation des investissements dans un réseau électrique.EDF Bulletin des Etudes et Recherches,serie C, No2, pp133–164.
Editor information
Rights and permissions
Copyright information
© 1986 International Institute for Applied Systems Analysis
About this paper
Cite this paper
Goursat, M., Quadrat, J.P., Inria, M.V. (1986). Stochastic gradient methods for optimizing electrical transportation networks. In: Arkin, V.I., Shiraev, A., Wets, R. (eds) Stochastic Optimization. Lecture Notes in Control and Information Sciences, vol 81. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0007114
Download citation
DOI: https://doi.org/10.1007/BFb0007114
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16659-7
Online ISBN: 978-3-540-39841-7
eBook Packages: Springer Book Archive