论文信息 - Discrete optimization via SPSA

Discrete optimization via SPSA

We consider the use of a fixed gain version of SPSA (simultaneous perturbation stochastic approximation) for optimizing a class of discrete functions. The procedure has been modified to obtain an optimization method that is applicable to cost functions defined on a grid of points in Euclidean p-space having integer components. We discuss some related results on fixed gain SPSA and describe an application of the method to a resource allocation problem.

[1] Toshihide Ibaraki,et al. Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[2] László Gerencsér,et al. Optimization over discrete sets via SPSA , 1999, WSC '99.

[3] C. Cassandras,et al. Ordinal optimization for a class of deterministic and stochastic discrete resource allocation problems , 1998, IEEE Trans. Autom. Control..

[4] L. Gerencsér. SPSA with state-dependent noise-a tool for direct adaptive control , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[5] L. Gerencsér. On fixed gain recursive estimation processes , 1996 .

[6] László Gerencsér,et al. Convergence rate of moments in stochastic approximation with simultaneous perturbation gradient approximation and resetting , 1999, IEEE Trans. Autom. Control..

[7] L. Gerencsér,et al. Optimization over discrete sets via SPSA , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[8] J. Spall. Multivariate stochastic approximation using a simultaneous perturbation gradient approximation , 1992 .

[9] Han-Fu Chen,et al. A Stochastic Approximation Algorithm with Random Differences , 1996 .

[10] James N. Eagle,et al. An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem , 1990, Oper. Res..

[11] L. Gerencs. On Fixed Gain Recursive Estimation Processes , 1996 .