Inverse analysis method using MPP-based dimension reduction for reliability-based design optimization of nonlinear and multi-dimensional systems

There are two commonly used analytical reliability analysis methods: linear approximation - first-order reliability method (FORM), and quadratic approximation - second-order reliability method (SORM), of the performance function. The reliability analysis using FORM could be acceptable in accuracy for mildly nonlinear performance functions, whereas the reliability analysis using SORM may be necessary for accuracy of nonlinear and multi-dimensional performance functions. Even though the reliability analysis using SORM may be accurate, it is not as much used for probability of failure calculation since SORM requires the second-order sensitivities. Moreover, the SORM-based inverse reliability analysis is rather difficult to develop.This paper proposes an inverse reliability analysis method that can be used to obtain accurate probability of failure calculation without requiring the second-order sensitivities for reliability-based design optimization (RBDO) of nonlinear and multi-dimensional systems. For the inverse reliability analysis, the most probable point (MPP)-based dimension reduction method (DRM) is developed. Since the FORM-based reliability index (β) is inaccurate for the MPP search of the nonlinear performance function, a three-step computational procedure is proposed to improve accuracy of the inverse reliability analysis: probability of failure calculation using constraint shift, reliability index update, and MPP update. Using the three steps, a new DRM-based MPP is obtained, which estimates the probability of failure of the performance function more accurately than FORM and more efficiently than SORM. The DRM-based MPP is then used for the next design iteration of RBDO to obtain an accurate optimum design even for nonlinear and/or multi-dimensional system. Since the DRM-based RBDO requires more function evaluations, the enriched performance measure approach (PMA+) with new tolerances for constraint activeness and reduced rotation matrix is used to reduce the number of function evaluations.     

Probabilistic sensitivity analysis for novel second-order reliability method (SORM) using generalized chi-squared distribution

Reliability-based design optimization (RBDO) requires evaluation of sensitivities of probabilistic constraints. To develop RBDO utilizing the recently proposed novel second-order reliability method (SORM) that improves conventional SORM approaches in terms of accuracy, the sensitivities of the probabilistic constraints at the most probable point (MPP) are required. Thus, this study presents sensitivity analysis of the novel SORM at MPP for more accurate RBDO. During analytic derivation in this study, it is assumed that the Hessian matrix does not change due to the small change of design variables. The calculation of the sensitivity based on the analytic derivation requires evaluation of probability density function (PDF) of a linear combination of non-central chi-square variables, which is obtained by utilizing general chi-squared distribution. In terms of accuracy, the proposed probabilistic sensitivity analysis is compared with the finite difference method (FDM) using the Monte Carlo simulation (MCS) through numerical examples. The numerical examples demonstrate that the analytic sensitivity of the novel SORM agrees very well with the sensitivity obtained by FDM using MCS when a performance function is quadratic in U-space and input variables are normally distributed. It is further shown that the proposed sensitivity is accurate enough compared with FDM results even for a higher order performance function.     

Response surface single loop reliability-based design optimization with higher-order reliability assessment

Reliability-based design optimization (RBDO) aims at determination of the optimal design in the presence of uncertainty. The available Single-Loop approaches for RBDO are based on the First-Order Reliability Method (FORM) for the computation of the probability of failure, along with different approximations in order to avoid the expensive inner loop aiming at finding the Most Probable Point (MPP). However, the use of FORM in RBDO may not lead to sufficient accuracy depending on the degree of nonlinearity of the limit-state function. This is demonstrated for an extensively studied reliability-based design for vehicle crashworthiness problem solved in this paper, where all RBDO methods based on FORM strongly violates the probabilistic constraints. The Response Surface Single Loop (RSSL) method for RBDO is proposed based on the higher order probability computation for quadratic models previously presented by the authors. The RSSL-method bypasses the concept of an MPP and has high accuracy and efficiency. The method can solve problems with both constant and varying standard deviation of design variables and is particularly well suited for typical industrial applications where general quadratic response surface models can be used. If the quadratic response surface models of the deterministic constraints are valid in the whole region of interest, the method becomes a true single loop method with accuracy higher than traditional SORM. In other cases, quadratic response surface models are fitted to the deterministic constraints around the deterministic solution and the RBDO problem is solved using the proposed single loop method.     

Range and Null Space Decomposition applied to analysis of slender concrete columns

The strength analysis of a simply supported slender concrete column subject to biaxial bending is formulated as a nonlinear programming problem. Geometrical imperfections as well as two types of concrete constitutive equations, for local and global verifications, are taken into account. The algorithm of choice is the Sequential Quadratic Programming method (SQP). Large numbers of state variables and equilibrium equality constraints appear in the formulation, which is a characteristic of the optimization of nonlinear structures in general. This considerably hinders the efficiency and robustness of the SQP algorithm. Therefore the Range and Null Space Decomposition (RND) is employed in order to decrease the size of the quadratic programming subproblem that must be solved in each iteration, as well as the size of the approximating Hessian that must be updated. An example is presented to illustrate the efficiency of the proposed approach which took almost one-third of the CPU time required by the standard SQP algorithm to converge to a solution.     

Bayesian reliability-based design optimization using eigenvector dimension reduction (EDR) method

In practical engineering design, most data sets for system uncertainties are insufficiently sampled from unknown statistical distributions, known as epistemic uncertainty. Existing methods in uncertainty-based design optimization have difficulty in handling both aleatory and epistemic uncertainties. To tackle design problems engaging both epistemic and aleatory uncertainties, reliability-based design optimization (RBDO) is integrated with Bayes theorem. It is referred to as Bayesian RBDO. However, Bayesian RBDO becomes extremely expensive when employing the first- or second-order reliability method (FORM/SORM) for reliability predictions. Thus, this paper proposes development of Bayesian RBDO methodology and its integration to a numerical solver, the eigenvector dimension reduction (EDR) method, for Bayesian reliability analysis. The EDR method takes a sensitivity-free approach for reliability analysis so that it is very efficient and accurate compared with other reliability methods such as FORM/SORM. Efficiency and accuracy of the Bayesian RBDO process are substantially improved after this integration.     

Extension of optimum safety factor method to nonlinear reliability-based design optimization

In the reliability-based design optimization (RBDO) model, the mean values of uncertain system variables are usually applied as design variables, and the cost is optimized subject to prescribed probabilistic constraints as defined by a nonlinear mathematical programming problem. Therefore, a RBDO solution that reduces the structural weight in uncritical regions does not only provide an improved design but also a higher level of confidence in the design. In this paper, we present recent developments for the RBDO model relative to two points of view: reliability and optimization. Next, we develop several distributions for the hybrid method and the optimum safety factor methods (linear and nonlinear RBDO). Finally, we demonstrate the efficiency of our safety factor approach extended to nonlinear RBDO with application to a tri-material structure.     

A direct decoupling approach for efficient reliability-based design optimization

This paper develops an efficient methodology to perform reliability-based design optimization (RBDO) by decoupling the optimization and reliability analysis iterations that are nested in traditional formulations. This is achieved by approximating the reliability constraints based on the reliability analysis results. The proposed approach does not use inverse first-order reliability analysis as other existing decoupled approaches, but uses direct reliability analysis. This strategy allows a modular approach and the use of more accurate methods, including Monte-Carlo-simulation (MCS)-based methods for highly nonlinear reliability constraints where first-order reliability approximation may not be accurate. The use of simulation-based methods also enables system-level reliability estimates to be included in the RBDO formulation. The efficiency of the proposed RBDO approach is further improved by identifying the potentially active reliability constraints at the beginning of each reliability analysis. A vehicle side impact problem is used to examine the proposed method, and the results show the usefulness of the proposed method.     

A general RBDO decoupling approach for different reliability analysis methods

There are available in the literature several papers on the development of methods to decouple the reliability analysis and the structural optimization to solve RBDO problems. Most of them focused on strategies that employ the First Order Reliability Method (FORM) to approximate the reliability constraints. Despite of all these developments, one limitation prevailed: the lack of accuracy in the approximation of the reliability constraints due to the use of FORM. Thus, in this paper, a novel approach for RBDO is presented in order to overcome such a limitation. In this approach, we use the concept of shifting vectors, originally developed in the context of the Sequential Optimization and Reliability Assessment (SORA). However, the shifting vectors are found and updated based on a novel strategy. The resulting framework is able to use any technique for the reliability analysis stage, such as Monte Carlo simulation, second order reliability methods, stochastic polynomials, among others. Thus, the proposed approach overcomes the aforementioned limitation of most of RBDO decoupling techniques, which required the use of FORM for reliability analysis. Several examples are analyzed in order to show the effectiveness of the methodology. Focus is given on examples that are poorly solved or even cannot be tackled by FORM based approaches, such as highly nonlinear limit state functions comprised by a maximum operator or problems with discrete random variables. It should be remarked that the proposed approach was not developed to be more computationally efficient than RBDO decoupling strategies based FORM, but to allow the utilization of any, including more accurate, reliability analysis method.     

Relaxed performance measure approach for reliability-based design optimization

The efficiency and robustness of reliability analysis methods are important factors to evaluate the probabilistic constraints in reliability-based design optimization (RBDO). In this paper, a relaxed mean value (RMV) approach is proposed in order to evaluate probabilistic constraints including convex and concave functions in RBDO using the performance measure approach (PMA). A relaxed factor is adaptively determined in the range from 0 to 2 using an inequality criterion to improve the efficiency and robustness of the inverse first-order reliability methods. The performance of the proposed RMV is compared with six existing reliability methods, including the advanced mean value (AMV), conjugate mean value (CMV), hybrid mean value (HMV), chaos control (CC), modified chaos control (MCC), and conjugate gradient analysis (CGA) methods, through four nonlinear concave and convex performance functions and three RBDO problems. The results demonstrate that the proposed RMV is more robust than the AMV, CMV, and HMV for highly concave problems, and slightly more efficient than the CC, MCC, and CGA methods. Furthermore, the proposed relaxed mean value guarantees robust and efficient convergence for RBDO problems with highly nonlinear performance functions.     

Single-loop system reliability-based topology optimization considering statistical dependence between limit-states

This paper presents a single-loop algorithm for system reliability-based topology optimization (SRBTO) that can account for statistical dependence between multiple limit-states, and its applications to computationally demanding topology optimization (TO) problems. A single-loop reliability-based design optimization (RBDO) algorithm replaces the inner-loop iterations to evaluate probabilistic constraints by a non-iterative approximation. The proposed single-loop SRBTO algorithm accounts for the statistical dependence between the limit-states by using the matrix-based system reliability (MSR) method to compute the system failure probability and its parameter sensitivities. The SRBTO/MSR approach is applicable to general system events including series, parallel, cut-set and link-set systems and provides the gradients of the system failure probability to facilitate gradient-based optimization. In most RBTO applications, probabilistic constraints are evaluated by use of the first-order reliability method for efficiency. In order to improve the accuracy of the reliability calculations for RBDO or RBTO problems with high nonlinearity, we introduce a new single-loop RBDO scheme utilizing the second-order reliability method and implement it to the proposed SRBTO algorithm. Moreover, in order to overcome challenges in applying the proposed algorithm to computationally demanding topology optimization problems, we utilize the multiresolution topology optimization (MTOP) method, which achieves computational efficiency in topology optimization by assigning different levels of resolutions to three meshes representing finite element analysis, design variables and material density distribution respectively. The paper provides numerical examples of two- and three-dimensional topology optimization problems to demonstrate the proposed SRBTO algorithm and its applications. The optimal topologies from deterministic, component and system RBTOs are compared with one another to investigate the impact of optimization schemes on final topologies. Monte Carlo simulations are also performed to verify the accuracy of the failure probabilities computed by the proposed approach.     

A sequential approximate programming strategy for reliability-based structural optimization

Although reliability-based structural optimization (RBSO) is recognized as a rational structural design philosophy that is more advantageous to deterministic optimization, most common RBSO is based on straightforward two-level approach connecting algorithms of reliability calculation and that of design optimization. This is achieved usually with an outer loop for optimization of design variables and an inner loop for reliability analysis. A number of algorithms have been proposed to reduce the computational cost of such optimizations, such as performance measure approach, semi-infinite programming, and mono-level approach. Herein the sequential approximate programming approach, which is well known in structural optimization, is extended as an efficient methodology to solve RBSO problems. In this approach, the optimum design is obtained by solving a sequence of sub-programming problems that usually consist of an approximate objective function subjected to a set of approximate constraint functions. In each sub-programming, rather than direct Taylor expansion of reliability constraints, a new formulation is introduced for approximate reliability constraints at the current design point and its linearization. The approximate reliability index and its sensitivity are obtained from a recurrence formula based on the optimality conditions for the most probable failure point (MPP). It is shown that the approximate MPP, a key component of RBSO problems, is concurrently improved during each sub-programming solution step. Through analytical models and comparative studies over complex examples, it is illustrated that our approach is efficient and that a linearized reliability index is a good approximation of the accurate reliability index. These unique features and the concurrent convergence of design optimization and reliability calculation are demonstrated with several numerical examples.     

Extensions of design potential concept for reliability-based design optimization to nonsmooth and extreme cases

The reliability-based design optimization (RBDO) can be described by the design potential concept in a unified system space, where the probabilistic constraint is identified by the design potential surface of the reliability target that is obtained analytically from the first-order reliability method (FORM). This paper extends the design potential concept to treat nonsmooth probabilistic constraints and extreme case design in RBDO. In addition, refinement of the design potential surface, which yields better optimum design, can be obtained using more accurate second-order reliability method (SORM). By integrating performance probability analysis into the iterative design optimization process, the design potential concept leads to a very effective design potential method (DPM) for robust system parameter design. It can also be applied effectively to extreme case design (ECD) by directly representing a probabilistic constraint in terms of the system performance function. Received July 25, 2000     

A stability investigation of a simulation- and reliability-based optimization

This study developed a reliability-based design optimization (RBDO) algorithm focusing on the ability of solving problems with nonlinear constraints or system reliability. In this case, a sampling technique is often adopted to evaluate the reliability analyses. However, simulation with an insufficient sample size often possesses statistical randomness resulting in an inaccurate sensitivity calculation. This may cause an unstable RBDO solution. The proposed approach used a set of deterministic variables, called auxiliary design points, to replace the random parameters. Thus, an RBDO is converted into a deterministic optimization (DO, α-problem). The DO and the analysis of finding the auxiliary design points (β-problem) are conducted iteratively until the solution converges. To maintain the stability of the RBDO solution with less computational cost, the proposed approach calculated the sensitivity of reliability (in the β-problem) with respect to the mean value of the pseudo-random parameters rather than the design variables. The stability of the proposed method was compared to that of the double-loop approach, and many factors, such as sample size, starting point and the parameters used in the optimization, were considered. The accuracy of the proposed method was confirmed using Monte Carlo simulation (MCS) with several linear and nonlinear numerical problems.     

Experience with approximate reliability-based optimization methods

Traditional reliability-based design optimization (RBDO) requires a double loop iteration process. The inner optimization loop is to find the most probable point (MPP) and the outer is the regular optimization loop to optimize the RBDO problem with reliability objectives or constraints. It is well known that the computation can be prohibitive when the associated function evaluation is expensive. As a result, many approximate RBDO methods, which convert the double loop to a single loop, have been developed. In this work, several approximate RBDO methods are coded, discussed, and tested against a double loop algorithm through four design problems.     

An optimal shifting vector approach for efficient probabilistic design

The application of reliability-based design optimization (RBDO) is hindered by the unbearable computational cost in the structure reliability evaluating process. This study proposes an optimal shifting vector (OSV) approach to enhance the efficiency of RBDO. In OSV, the idea of using an optimal shifting vector in the decoupled method and the notation of conducting reliability analysis in the super-sphere design space are proposed. The shifted limit state function, instead of the specific performance function, is used to identify the inverse most probable point (IMPP) and derive the optimal shifting vector for accelerating the optimization process. The super-sphere design space is applied to reduce the number of constraints and design variables for the novel reliability analysis model. OSV is very efficient for highly nonlinear problems, especially when the contour lines of the performance functions vary widely. The computation capability of the proposed method is demonstrated and compared to existing RBDO methods using four mathematical and engineering examples. The comparison results show that the proposed OSV approach is very efficient.     

Improved hybrid method as a robust tool for reliability-based design optimization

In the engineering problems, the randomness and the uncertainties of the distribution of the structural parameters are a crucial problem. In the case of reliability-based design optimization (RBDO), it is the objective to play a dominant role in the structural optimization problem introducing the reliability concept. The RBDO problem is often formulated as a minimization of the initial structural cost under constraints imposed on the values of elemental reliability indices corresponding to various limit states. The classical RBDO leads to high computing time and weak convergence, but a Hybrid Method (HM) has been proposed to overcome these two drawbacks. As the hybrid method successfully reduces the computing time, we can increase the number of variables by introducing the standard deviations as optimization variables to minimize the error values in the probabilistic model. The efficiency of the hybrid method has been demonstrated on static and dynamic cases with extension to the variability of the probabilistic model. In this paper, we propose a modification on the formulation of the hybrid method to improve the optimal solutions. The proposed method is called, Improved Hybrid Method (IHM). The main benefit of this method is to improve the structure performance by much more minimizing the objective function than the hybrid method. It is also shown to demonstrate the optimality conditions. The improved hybrid method is next applied to two numerical examples, with consideration of the standard deviations as optimization variables (for linear and nonlinear distributions). When integrating the improved hybrid method within the probabilistic model variability, we minimize the objective function more and more.     

基于SQP/GA混合优化算法的双容水箱非线性预测控制

为了计算控制序列，非线性模型预测控制可以转换为一个带约束的非线性优化过程．本文分析了三种约束处理方案，根据遗传算法的特点，将等式约束用于状态量计算，在搜索空间降维的同时消除遗传算法难以求解的等式约束．对双容水箱进行遗传算法和序列二次规划仿真试验和实际控制，结果表明遗传算法对控制量的优化效果优于序列二次规划．为克服遗传算法耗时较长、优化结果存在随机抖动的缺点，结合序列二次规划提出一种混合优化算法，仿真和实控结果表明其可行性和有效性．     

A new SQP approach for nonlinear complementarity problems

Sequential quadratic programming (SQP) methods have been extensively studied to handle nonlinear programming problems. In this paper, a new SQP approach is employed to tackle nonlinear complementarity problems (NCPs). At each iterate, NCP conditions are divided into two parts. The inequalities and equations in NCP conditions, which are violated in the current iterate, are treated as the objective function, and the others act as constraints, which avoids finding a feasible initial point and feasible iterate points. NCP conditions are consequently transformed into a feasible nonlinear programming subproblem at each step. New SQP techniques are therefore successful in handling NCPs.     

A Chance Constrained Optimal Reserve Scheduling Approach for Economic Dispatch Considering Wind Penetration

The volatile wind power generation brings a full spectrum of problems to power system operation and management, ranging from transient system frequency fluctuation to steady state supply and demand balancing issue. In this paper, a novel wind integrated power system day-ahead economic dispatch model, with the consideration of generation and reserve cost is modelled and investigated. The proposed problem is first formulated as a chance constrained stochastic nonlinear programming (CCSNLP), and then transformed into a deterministic nonlinear programming (NLP). To tackle this NLP problem, a three-stage framework consists of particle swarm optimization (PSO), sequential quadratic programming (SQP) and Monte Carlo simulation (MCS) is proposed. The PSO is employed to heuristically search the line power flow limits, which are used by the SQP as constraints to solve the NLP problem. Then the solution from SQP is verified on benchmark system by using MCS. Finally, the verified results are feedback to the PSO as fitness value to update the particles. Simulation study on IEEE 30-bus system with wind power penetration is carried out, and the results demonstrate that the proposed dispatch model could be effectively solved by the proposed three-stage approach.      

First-order sequential convex programming using approximate diagonal QP subproblems

Optimization algorithms based on convex separable approximations for optimal structural design often use reciprocal-like approximations in a dual setting; CONLIN and the method of moving asymptotes (MMA) are well-known examples of such sequential convex programming (SCP) algorithms. We have previously demonstrated that replacement of these nonlinear (reciprocal) approximations by their own second order Taylor series expansion provides a powerful new algorithmic option within the SCP class of algorithms. This note shows that the quadratic treatment of the original nonlinear approximations also enables the restatement of the SCP as a series of Lagrange-Newton QP subproblems. This results in a diagonal trust-region SQP type of algorithm, in which the second order diagonal terms are estimated from the nonlinear (reciprocal) intervening variables, rather than from historic information using an exact or a quasi-Newton Hessian approach. The QP formulation seems particularly attractive for problems with far more constraints than variables (when pure dual methods are at a disadvantage), or when both the number of design variables and the number of (active) constraints is very large.