Newton-based stochastic optimization using q-Gaussian smoothed functional algorithms

Ghoshdastidar, Debarghya ; Dukkipati, Ambedkar ; Bhatnagar, Shalabh (2014) Newton-based stochastic optimization using q-Gaussian smoothed functional algorithms Automatica, 50 (10). pp. 2606-2614. ISSN 0005-1098

Full text not available from this repository.

Official URL: http://doi.org/10.1016/j.automatica.2014.08.021

Related URL: http://dx.doi.org/10.1016/j.automatica.2014.08.021

Abstract

We present the first q-Gaussian smoothed functional (SF) estimator of the Hessian and the first Newton-based stochastic optimization algorithm that estimates both the Hessian and the gradient of the objective function using q-Gaussian perturbations. Our algorithm requires only two system simulations (regardless of the parameter dimension) and estimates both the gradient and the Hessian at each update epoch using these. We also present a proof of convergence of the proposed algorithm. In a related recent work (Ghoshdastidar, Dukkipati, & Bhatnagar, 2014), we presented gradient SF algorithms based on the q-Gaussian perturbations. Our work extends prior work on SF algorithms by generalizing the class of perturbation distributions as most distributions reported in the literature for which SF algorithms are known to work turn out to be special cases of the q-Gaussian distribution. Besides studying the convergence properties of our algorithm analytically, we also show the results of numerical simulations on a model of a queuing network, that illustrate the significance of the proposed method. In particular, we observe that our algorithm performs better in most cases, over a wide range of -values, in comparison to Newton SF algorithms with the Gaussian and Cauchy perturbations, as well as the gradient q-Gaussian SF algorithms.

Item Type:Article
Source:Copyright of this article belongs to Elsevier B.V.
ID Code:116502
Deposited On:12 Apr 2021 06:03
Last Modified:12 Apr 2021 06:03

Repository Staff Only: item control page