2017
DOI: 10.1155/2017/8643801
|View full text |Cite
|
Sign up to set email alerts
|

A Comparative Study of First-Order Reliability Method-Based Steepest Descent Search Directions for Reliability Analysis of Steel Structures

Abstract: Three algorithms of first-order reliability method (FORM) using steepest descent search direction are compared to evaluate the reliability index of structural steel problems which are designed by the Iranian National Building code. The FORM formula is modified based on a dynamic step size which is computed based on the merit functions named modified Hasofer-Lind and Rackwitz-Fiessler (MHL-RF) method. The efficiency of the gradient, HL-RF, and MHL-RF method was compared for a bar structure under tensile capacit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…RSM is a sequential procedure. Frequently, the initial estimate of the optimum operating condition for the system will be far away from the actual optimum (Elliott et al , 2016; Makhduomi et al , 2017). The objective here is to lead the experiments rapidly and efficiently along a path of improvement toward the general vicinity of the optimum.…”
Section: Response Surface Methodologymentioning
confidence: 99%
“…RSM is a sequential procedure. Frequently, the initial estimate of the optimum operating condition for the system will be far away from the actual optimum (Elliott et al , 2016; Makhduomi et al , 2017). The objective here is to lead the experiments rapidly and efficiently along a path of improvement toward the general vicinity of the optimum.…”
Section: Response Surface Methodologymentioning
confidence: 99%
“…Obviously, IRM represents an iterative procedure, where a discrete Ritz method is applied at each step, and a suitable set of coordinate vectors which span a subspace are generated. A local energy minimum is sought within that subspace (therefore (5) should be solved at each step), thereby decreasing the total energy of the system, which eventually converges to the required minimum. The subspace dimension, or the size of (5), is not limited.…”
Section: Briefly About Irmmentioning
confidence: 99%
“…Also, recurrence relation in (11) becomes r (i+1) ← r (i) − ω (i) β (i) . Obviously, using ω = 1, A-orthogonality is lost, but convergence is improved in many cases [5]. The third advantage is the very natural adoption of (multi) preconditioning-like techniques [6].…”
Section: Advantages Of Irm-cg Over Cgmentioning
confidence: 99%