Abstract

The gradient projection algorithm with adaptive mutation step length for non-probabilistic reliability index

Highlights

  • Reliability problem derives from uncertainties existing in the engineering

  • By the example of solving non-probabilistic reliability indexes, it is showed that the algorithm integrates the advantages of gradient projection algorithm and adaptive algorithm

  • Because of the simple algorithm and clear mathematical meaning, gradient projection algorithm can be widely used in the probabilistic reliability analysis

Read more

Summary

Introduction

Reliability problem derives from uncertainties existing in the engineering. The probabilistic model cannot be defined for the reason of no statistical properties parameters. The gradient projection algorithm with adaptive mutation step length for non-probabilistic reliability index iteration appeared premature convergence, it could adaptively mutate step length and help the search to get rid of local optimal area. In this way, it effectively avoided premature convergence and improved the global optimization capabilities of the algorithm. By the example of solving non-probabilistic reliability indexes, it is showed that the algorithm integrates the advantages of gradient projection algorithm and adaptive algorithm It takes into account both local performance and global search ability, and has high precision to dispose the optimization problem of highdimensional and complex non-probabilistic reliability

Interval reliability index
Gradient algorithm and its improvement
Gradient projection algorithm
Adaptive step-size strategy
Mutation step-size mechanism
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.