Discretization of optimal shape design problems leads to very large nonlinear optimization problems. For attaining maximum computational efficiency, a sequential quadratic programming (SQP) algorithm should achieve superlinear convergence while preserving sparsity and convexity of the resulting quadratic programs. Most classical SQP approaches violate at least one of the requirements. We show t...

Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second derivative information may often be calculated, there is little practical theory that justifies exact-Hessian SQP methods. In particular, the resulting quadratic programming (QP) subproblems are often nonconvex, and thus finding th...

This paper proposes an algorithm for Public Key Cryptography (PKC) using the hybrid concept of two evolutionary algorithms, Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) respectively. PSO alone are fast and easy to implement, they follow the procedures of common evolutionary algorithm and posses memory feature which is absent in GA making it more valuable. In GA whole population ...

This paper presents a modification of tlte panicle swarm optimization algorithm (PSO) intended to combat the problem ofpremature convergence observed in many applications of PSO. The proposed new algorithm moves particles towards neorby particles of higher fitness, instead of amacting each panicle towards just the best position discovered so far by any particle. This is accomplished by using th...

In this paper, aim at the disadvantages of standard Particle Swarm Optimization (PSO) algorithm like being trapped easily into a local optimum, we improves the standard PSO and proposes a new algorithm to solve the overcomes of the standard PSO. The new algorithm keeps not only the fast convergence speed characteristic of PSO, but effectively improves the capability of global searching as well....

This paper presents a designing an optimal adaptive controller for tracking down the control of robot manipulators based on particle swarm optimization (PSO) algorithm. PSO algorithm has been used to optimize parameters of the controller and hence to minimize the integral square of errors (ISE) as a performance criteria. In this paper, an improved PSO using a logic is proposed to increase the c...

A total of 1099 data points consisting of alcohol-alcohol, alcohol-alkane, alkane-alkane, alcohol-amine and acid-acid binary solutions were collected from scientific literature to develop an appropriate artificial neural network (ANN) model. Temperature, molecular weight of the pure components, mole fraction of one component and the structural groups of the components were used as input paramet...

The authors applied the particle swarm optimization (PSO) algorithm to solve the conditional nonlinear optimal perturbation (CNOP) and the lower bound of maximum predictable time (LBMPT). The results obtained by the PSO algorithm were compared to those by the traditional optimization algorithm (such as, a gradient descent algorithm based on the adjoint model, ADJ). The authors found that the PS...

The authors applied the particle swarm optimization (PSO) algorithm to solve the conditional nonlinear optimal perturbation (CNOP) and the lower bound of maximum predictable time (LBMPT). The results obtained by the PSO algorithm were compared to those by the traditional optimization algorithm (such as, a gradient descent algorithm based on the adjoint model, ADJ). The authors found that the PS...

In this paper an extensive theoretical and empirical analysis of recently introduced Particle Swarm Optimization algorithm with Convergence Related parameters (CR-PSO) is presented. The convergence of the classical PSO algorithm is addressed in detail. The conditions that should be imposed on parameters of the algorithm in order for it to converge in mean-square have been derived. The practical...