Abstract
The minimization of a convex function defined over the grid Z/sup p/ is considered. A few relevant mathematical devices such as integer convexity, Markov chain Monte Carlo (MCMC) methods, including stochastic comparison (SC), and simultaneous perturbation stochastic approximation (SPSA) are summarized. A truncated fixed gain SPSA method is proposed and investigated in combination with devices borrowed from the MCMC literature. The main contribution of the paper is the development and testing a number of devices that may eventually improve the convergence properties of the algorithm, such as various truncation techniques, averaging and choices of acceptance probabilities. The basis for comparison of performances is accuracy vs. number of function evaluations. We present experimental evidence for the superiority of an SC method allowing moves in wrong directions with small probability, where the underlying method is an SPSA method using averaging and adaptive truncation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.