Stochastic approximation on discrete sets using simultaneous difference approximations

Proceedings of the American Control Conference

Volumn 3, Issue , 2004, Pages 2795-2798

  Hill, Stacy D ^a   Gerencsér, László ^b   Vágó, Zsuzsanna ^b,c  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c PÁZMÁNY PÉTER CATHOLIC UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE FUNCTIONS; REAL-VALUED FUNCTIONS; SIMULTANEOUS PERTURBATION STOCHASTIC APPROXIMATION (SPSA);

ALGORITHMS; OPTIMIZATION; PERTURBATION TECHNIQUES; PROBLEM SOLVING; RANDOM PROCESSES; SCHEDULING; SET THEORY;

APPROXIMATION THEORY;

EID: 8744306847     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2004.182530     Document Type: Conference Paper

References (17)

1. J. C. Spall. "Multivariate stochastic approximation using a simultaneous perturbation gradient approximation," IEEE Trans. on Automat. Contr., vol. 37, pp. 332-341, 1992.
2. th Triennial IFAC World Congress, pages 493-496, 1996.
3. L. Gerencsér. "On fixed gain recursive estimation processes," J. of Mathematical Systems, Estimation and Control, vol. 6, pp. 355-358, 1996.
4. L. Gerencsér. "Rate of convergence of moments for a simultaneous perturbation stochastic approximation method for function minimization," IEEE Trans. on Automat. Contr., vol. 44, pp. 894-906, 1999.
5. L. Gerencsér. "SPSA with state-dependent noise - a tool for direct adaptive control," Proceedings of the Conference on Decision and Control, CDC 37, 1998.
6. C. G. Cassandras, L. Dai, and C. G. Panayiotou. "Ordinal optimization for a class of deterministic and stochastic discrete resource allocation problems," IEEE Trans. Auto. Contr., vol. 43(7): pp. 881-900, 1998.
7. L. Gerencsér, S. D. Hill, and Z. Vágó. "Optimization over discrete sets via SPSA," Proceedings of the Conference on Decision and Control, CDC 38, 1999.
8. T. Ibaraki and N. Katoh. Resource Allocation Problems: Algorithmic Approaches. MIT Press, 1988.
9. J.E. Whitney, II, S. D. Hill, and L. I. Solomon, "Constrained optimization over discrete sets via SPSA with application to non-separable resource allocation," Proceedings of the 2001 Winter Simulation Conference, pp. 313-317.
10. B.L. Miller, "On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application, SIAM Journal on Applied Mathematics, vol. 21, pp. 166-185.
11. P. Favati and F. Tardella, "Convexity in nonlinear integer programming," Ricerca Operativa, vol. 53, pp. 3-34, 1990.
12. V. Dupac and U. Herkenrath, "Stochastic approximation on a discrete set and the multi-armed bandit problem," Communications in Statistics-Sequential Analysis, vol 1, pp. 1025, 1982.
13. Hill, S. D., L. Gerencsér and Z. Vágó, "Stochastic Approximation on Discrete Sets Using Simultaneous Perturbation Difference Approximations," Proc. of the 2003 Conf. on Information Science and Systems, The Johns Hopkins University, March 12-14, 2003
14. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
15. Y. He, M. C. Fu, and S. I. Marcus, "Convergence of Simultaneous Perturbation Stochastic Approximation for Kondifferentiable Optimization," IEEE Trans. on Auto. Contr., vol. 48, pp. 1459-1463.
16. H. J. Kushner and G. G. Yin, Stochastic Approximation Algorithms and Applications. New York: Springer-Verlag, 1997.
17. J. N. Eagle and J. R. Yee. "An optimal branch-and-bound procedure for the constrained path, moving target search problem," Operations Research, vol. 8, 1990.