Technical gazette, Vol. 24 No. 1, 2017.
Original scientific paper
https://doi.org/10.17559/TV-20160502062504
The gradient projection algorithm with adaptive mutation step length for non-probabilistic reliability index
Zhaoping Tang
; School of Information Engineering, East China Jiao Tong University, No. 808 Shuanggang East Avenue, Nanchang Jiangxi, 330013, China
Jin Qin
; School of Railway, Central South University, No. 68 Shaoshan South Road, Changsha Hunan, 410075, China
Jianping Sun
; School of Railway Transportation, East China Jiao Tong University, No. 808 Shuanggang East Avenue, Nanchang Jiangxi, 330013, China
Biao Geng
; School of Railway Transportation, East China Jiao Tong University, No. 808 Shuanggang East Avenue, Nanchang Jiangxi, 330013, China
Abstract
Aiming at the problems of selection parameter step-size and premature convergence that occurred when searching the local area in the optimal design of adaptive gradient projection algorithm in this paper, adaptive variable step-size mechanism strategy and adaptive variable step-size mechanism were established. They were introduced into the gradient projection algorithm, and were used to control iteration step length. Through the examples of non-probabilistic reliability index, it can be showed that the method could quickly and accurately calculate the reliability index when the model had multiple variables and complex limit state function. To compare and contrast this algorithm with the simple gradient projection algorithm, this algorithm is not sensitive to the initial point position. And it not only takes into account both local performance and global search ability, but also has fast convergence speed and high precision. So it is an efficient and practical optimization algorithm.
Keywords
adaptive; gradient projection algorithm; mutation step length; non-probabilistic reliability
Hrčak ID:
174700
URI
Publication date:
10.2.2017.
Visits: 2.148 *