A new method for parameter sensitivity estimation in structural reliability analysis

For the parameter sensitivity estimation with implicit limit state functions in the time-invariant reliability analysis, the common Monte Carlo simulation based approach involves multiple trials for each parameter being varied, which will increase associated computational cost and the cost may become inevitably high especially when many random variables are involved. Another effective approach for this problem is featured as constructing the equivalent limit state function (usually called response surface) and performing the estimation in FORM/SORM. However, as the equivalent limit state function is polynomial in the traditional response surface method, it is not a good approximation especially for some highly non-linear limit state functions. To solve the above two problems, a new method, support vector regression based response surface method, is therefore presented in this paper. The support vector regression algorithm is employed to construct the equivalent limit state function and FORM/SORM is used in the parameter sensitivity estimation, and then two illustrative examples are given. It is shown that the computational cost of the sensitivity estimation can be greatly reduced and the accuracy can be retained, and results of the sensitivity estimation obtained by the proposed method are in satisfactory agreement with those computed by the conventional Monte Carlo methods.     

A semi-analytic method for calculating non-probabilistic reliability index based on interval models

This paper proves: (1) non-probabilistic reliability index of a structure exists merely at one of intersection points at which normalized failure surfaces of the structure intersects the straight lines passing not only through origin of an normalized infinite space but also through vertices of a symmetric convex polyhedron with its sym-center at the origin, and (2) the non-probabilistic reliability index equals to absolute value of the coordinate components of a particular intersection point. Based on a reduction of the feasible region, a semi-analytical method for calculating the reliability index is developed. The method proves to be simple and of practical significance, and has several advantages over the existing unconstrained multivariate nonlinear optimization approach.     

Non-probabilistic convex models and interval analysis method for dynamic response of a beam with bounded uncertainty

This paper is concerned with the comparison of two non-probabilistic set-theoretical models for dynamic response measures of an infinitely long beam. The beam is on an uncertain foundation and subjected to a moving force with constant speed. The steady state vibration is analyzed with finite element method. The dynamic responses of the beam are approximated to the first-order respect of the uncertainty variables. As a rule, in convex models and interval analysis, the uncertainties are considered to be unknown, but they give out their allowable vector space. Comparing the convex models with interval analysis in mathematical proofs and numerical calculations, it’s shows that under the condition of transform an interval vector to an outer enclosed ellipsoid, the dynamic response of the infinitely long beam predicted by interval analysis is smaller than that by convex models; under the condition of transform a hyperellipsoid to an outer enclosed interval vector, the dynamic response of the infinitely long beam calculated by convex models is smaller than that by interval analysis method.     

A DECOMPOSITION METHOD FOR CONVEX MINIMIZATION PROBLEMS AND ITS APPLICATION

1. IntroductionConsider the following special convex programming problem(P) adn{f(~) g(z); Ax = z},where f: Re - (--co, co] and g: Re - (--co, co] are closed proper convex functions andA is an m x n matrix. The Lagrangian for problem (P) is defined by L: Rad x Re x Re -- (~co, co] as follows:L(x, z, y) = f(x) g(z) (y, Ax ~ z), (1.1)where (., .) denotes the inner product in the general sense and 'y is the Lagrangian multiplierassociated with the constraint Ax = z. The augmented L…     

A convergence analysis for a convex version of Dikin's algorithm

This paper is concerned with the convergence property of Dikin's algorithm applied to linearly constrained smooth convex programs. We study a version of Dikin's algorithm in which a second-order approximation of the objective function is minimized at each iteration together with an affine transformation of the variables. We prove that the sequence generated by the algorithm globally converges to a limit point at a local linear rate if the objective function satisfies a Hessian similarity condition. The result is of a theoretical nature in the sense that in order to ensure that the limit point is an -optimal solution, one may have to restrict the steplength to the order ofO(). The analysis does not depend on non-degeneracy assumptions.     

A constraint shifting homotopy method for convex multi-objective programming

In this paper, a constraint shifting combined homotopy method for solving multi-objective programming problems with both equality and inequality constraints is presented. It does not need the starting point to be an interior point or a feasible point and hence is convenient to use. Under some assumptions, the existence and convergence of a smooth path to an efficient solution are proven. Simple numerical results are given.     

A markov process model for software reliability analysis

Software reliability is a rapidly developing discipline. In this paper we model the fault-detecting processes by Markov processes with decreasing jump intensity. The intensity function is suggested to be a power function of the number of the remaining faults in the software. The models generalize the software reliability model suggested by Jelinski and Moranda (‘Software reliability research’, in W. Freiberger (ed.), Statistical Computer Performance Evaluation, Academic Press, New York, 1972. pp. 465–497). The main advantage of our models is that we do not use the assumption that all software faults correspond to the same failure rate. Preliminary studies suggest that a second-order power function is quite a good approximation. Statistical tests also indicate that this may be the case. Numerical results show that the estimation of the expected time to next failure is both reasonable and decreases relatively stably when the number of removed faults is increased.     

The reliability analysis of probabilistic and interval hybrid structural system

The aim of this paper is to evaluate the reliability of probabilistic and interval hybrid structural system. The hybrid structural system includes two kinds of uncertain parameters—probabilistic parameters and interval parameters. Based on the interval reliability model and probabilistic operation, a new probabilistic and interval hybrid reliability model is proposed. Firstly, we use the interval reliability model to analyze the performance function, and then sum up reliability of all regions divided by the failure plane. Based on the presented optimal criterion enumerating the main failure modes of hybrid structural system and the relationship of failure modes, the reliability of structure system can be obtained. By means of the numerical examples, the hybrid reliability model and the traditional probabilistic reliability model are critically contrasted. The results indicate the presented reliability model is more suitable for analysis and design of these structural systems and it can ensure the security of system well, and it only needs less uncertain information.     

A convex analysis approach for convex multiplicative programming

Global optimization problems involving the minimization of a product of convex functions on a convex set are addressed in this paper. Elements of convex analysis are used to obtain a suitable representation of the convex multiplicative problem in the outcome space, where its global solution is reduced to the solution of a sequence of quasiconcave minimizations on polytopes. Computational experiments illustrate the performance of the global optimization algorithm proposed.      

Truncated regularized Newton method for convex minimizations

Recently, Li et al. (Comput. Optim. Appl. 26:131–147, 2004) proposed a regularized Newton method for convex minimization problems. The method retains local quadratic convergence property without requirement of the singularity of the Hessian. In this paper, we develop a truncated regularized Newton method and show its global convergence. We also establish a local quadratic convergence theorem for the truncated method under the same conditions as those in Li et al. (Comput. Optim. Appl. 26:131–147, 2004). At last, we test the proposed method through numerical experiments and compare its performance with the regularized Newton method. The results show that the truncated method outperforms the regularized Newton method. The work was supported by the 973 project granted 2004CB719402 and the NSF project of China granted 10471036.     

Solving quadratic convex bilevel programming problems using a smoothing method

In this paper, we present a smoothing sequential quadratic programming to compute a solution of a quadratic convex bilevel programming problem. We use the Karush-Kuhn-Tucker optimality conditions of the lower level problem to obtain a nonsmooth optimization problem known to be a mathematical program with equilibrium constraints; the complementary conditions of the lower level problem are then appended to the upper level objective function with a classical penalty. These complementarity conditions are not relaxed from the constraints and they are reformulated as a system of smooth equations by mean of semismooth equations using Fisher-Burmeister functional. Then, using a quadratic sequential programming method, we solve a series of smooth, regular problems that progressively approximate the nonsmooth problem. Some preliminary computational results are reported, showing that our approach is efficient.     

An efficient third-moment saddlepoint approximation for probabilistic uncertainty analysis and reliability evaluation of structures

This paper presents an efficient third-moment saddlepoint approximation approach for probabilistic uncertainty analysis and reliability evaluation of random structures. By constructing a concise cumulant generating function (CGF) for the state variable according to its first three statistical moments, approximate probability density function and cumulative distribution function of the state variable, which may possess any types of distribution, are obtained analytically by using saddlepoint approximation technique. A convenient generalized procedure for structural reliability analysis is then presented. In the procedure, the simplicity of general moment matching method and the accuracy of saddlepoint approximation technique are integrated effectively. The main difference of the presented method from existing moment methods is that the presented method may provide more detailed information about the distribution of the state variable. The main difference of the presented method from existing saddlepoint approximation techniques is that it does not strictly require the existence of the CGFs of input random variables. With the advantages, the presented method is more convenient and can be used for reliability evaluation of uncertain structures where the concrete probability distributions of input random variables are known or unknown. It is illustrated and examined by five representative examples that the presented method is effective and feasible.     

A hybrid convex variational model for image restoration

We propose a new hybrid model for variational image restoration using an alternative diffusion switching non-quadratic function with a parameter. The parameter is chosen adaptively so as to minimize the smoothing near the edges and allow the diffusion to smooth away from the edges. This model belongs to a class of edge-preserving regularization methods proposed in the past, the ?-function formulation. This involves a minimizer to the associated energy functional. We study the existence and uniqueness of the energy functional of the model. Using real and synthetic images we show that the model is effective in image restoration.     

An interior-point method for fractional programs with convex constraints

We present an interior-point method for a class of fractional programs with convex constraints. The proposed algorithm converges at a polynomial rate, similarly as in the case of a convex problem, even though fractional programs are only pseudo-convex. Here, the rate of convergence is measured in terms of the area of two-dimensional convex setsC _k containing the origin and certain projections of the optimal points, and the area ofC _k is reduced by a constant factorc < 1 at each iteration. The factorc depends only on the self-concordance parameter of a barrier function associated with the feasible set. We present an outline of a practical implementation of the proposed method, and we report results of some preliminary numerical experiments.Corresponding author.     

A Markov modulated Poisson model for software reliability

In this paper, we consider a latent Markov process governing the intensity rate of a Poisson process model for software failures. The latent process enables us to infer performance of the debugging operations over time and allows us to deal with the imperfect debugging scenario. We develop the Bayesian inference for the model and also introduce a method to infer the unknown dimension of the Markov process. We illustrate the implementation of our model and the Bayesian approach by using actual software failure data.     

A dynamic system model for solving convex nonlinear optimization problems

This paper proposes a feedback neural network model for solving convex nonlinear programming (CNLP) problems. Under the condition that the objective function is convex and all constraint functions are strictly convex or that the objective function is strictly convex and the constraint function is convex, the proposed neural network is proved to be stable in the sense of Lyapunov and globally convergent to an exact optimal solution of the original problem. The validity and transient behavior of the neural network are demonstrated by using some examples.     

A weighted gram-schmidt method for convex quadratic programming

Range-space methods for convex quadratic programming improve in efficiency as the number of constraints active at the solution decreases. In this paper we describe a range-space method based upon updating a weighted Gram-Schmidt factorization of the constraints in the active set. The updating methods described are applicable to both primal and dual quadratic programming algorithms that use an active-set strategy. Many quadratic programming problems include simple bounds on all the variables as well as general linear constraints. A feature of the proposed method is that it is able to exploit the structure of simple bound constraints. This allows the method to retain efficiency when the number ofgeneral constraints active at the solution is small. Furthermore, the efficiency of the method improves as the number of active bound constraints increases. This research was supported by the U.S. Department of Energy Contract DE-AC03-76SF00326, PA No. DE-AT03-76ER72018; National Science Foundation Grants MCS-7926009 and ECS-8012974; the Office of Naval Research Contract N00014-75-C-0267; and the U.S. Army Research Office Contract DAAG29-79-C-0110. The work of Nicholas Gould was supported by the Science and Engineering Research Council of Great Britain.     

A regularized penalty method for solving convex semi-infinite programs

This paper is concerned with the stable solution of ill-posed convex semi-infinite problems on the base of their sequential approximation by finite dimensional convex problems on a sequence of grids. These auxiliary programs are constructed by using the iterative Prox-regularization and for solving each of them only one step of a penalty method is applied. A simple deletion procedure of inactive constraints is suggested. The choice of the control parameters secure the convergence of the methods and a linear convergence rate is obtained     

On the classical logarithmic barrier function method for a class of smooth convex programming problems

In this paper, we describe a natural implementation of the classical logarithmic barrier function method for smooth convex programming. It is assumed that the objective and constraint functions fulfill the so-called relative Lipschitz condition, with Lipschitz constantM>0.In our method, we do line searches along the Newton direction with respect to the strictly convex logarithmic barrier function if we are far away from the central trajectory. If we are sufficiently close to this path, with respect to a certain metric, we reduce the barrier parameter. We prove that the number of iterations required by the algorithm to converge to an -optimal solution isO((1+M ²) log) orO((1+M ²)nlog), depending on the updating scheme for the lower bound.on leave from Eötvös University, Budapest, Hungary.