Open Access

ARTICLE

New Optimization Algorithms for Structural Reliability Analysis

S.R. Santos¹, L.C. Matioli², A.T. Beck³

1 State University of Paraná, Department of Mathematics, CP 415, 87303-100, Campo Mourão-PR, Brazil. Ph.D. Program in Numerical Methods in Engineering, Federal University of Paraná, Curitiba-PR, Brazil. Partially supported by Fundação Araucária. E-mail: solaregina@fecilcam.br
2 Federal University of Paraná, Department of Mathematics, Centro Politécnico, CP 19081, 81531-990, Curitiba-PR, Brazil. E-mail: matioli@ufpr.br
3 University of São Paulo, São Carlos School of Engineering, Department of Structural Engineering,13566-590, São Carlos-SP, Brazil. E-mail: atbeck@sc.usp.br

Computer Modeling in Engineering & Sciences 2012, 83(1), 23-56. https://doi.org/10.3970/cmes.2012.083.023

Abstract

Solution of structural reliability problems by the First Order method require optimization algorithms to find the smallest distance between a limit state function and the origin of standard Gaussian space. The Hassofer-Lind-Rackwitz-Fiessler (HLRF) algorithm, developed specifically for this purpose, has been shown to be efficient but not robust, as it fails to converge for a significant number of problems. On the other hand, recent developments in general (augmented Lagrangian) optimization techniques have not been tested in aplication to structural reliability problems. In the present article, three new optimization algorithms for structural reliability analysis are presented. One algorithm is based on the HLRF, but uses a new differentiable merit function with Wolfe conditions to select step length in linear search. It is shown in the article that, under certain assumptions, the proposed algorithm generates a sequence that converges to the local minimizer of the problem. Two new augmented Lagrangian methods are also presented, which use quadratic penalties to solve nonlinear problems with equality constraints. Performance and robustness of the new algorithms is compared to the classic augmented Lagrangian method, to HLRF and to the improved HLRF (iHLRF) algorithms, in the solution of 25 benchmark problems from the literature. The new proposed HLRF algorithm is shown to be more robust than HLRF or iHLRF, and as efficient as the iHLRF algorithm. The two augmented Lagrangian methods proposed herein are shown to be more robust and more efficient than the classical augmented Lagrangian method.

---

Keywords

---