A New Method of Moving Asymptotes for Large-scale Linearly Equality-constrained Minimization

A new method of moving asymptotes for large-scale minimization subject to linear equality constraints is discussed. In this method, linear equality constraints are deleted with null space technique and the descending direction is obtained by solving a convex separable subproblem of moving asymptotes in each iteration. New rules for controlling the asymptotes parameters are designed and the global convergence of the method under some reasonable conditions is established and proved. The numerical results show that the new method may be capable of processing some large scale problems.

NEW HMM ALGORITHM FOR TOPOLOGY OPTIMIZATION

A new hybrid MMA-MGCMMA （HMM） algorithm for solving topology optimization problems is presented. This algorithm combines the method of moving asymptotes （MMA） algorithm and the modified globally convergent version of the method of moving asymptotes （MGCMMA） algorithm in the optimization process. This algorithm preserves the advantages of both MMA and MGCMMA. The optimizer is switched from MMA to MGCMMA automatically, depending on the numerical oscillation value existing in the calculation. This algorithm can improve calculation efficiency and accelerate convergence compared with simplex MMA or MGCMMA algorithms, which is proven with an example.

The equilibrium composition in Ge_xSi_1-_x/Si self-assembled alloy quantum dot

The equilibrium composition in strained quantum dot is the result of both elastic relaxation and chemical mixing effects, which have a direct relationship to the optical and electronic properties of the quantum-dot-based device. Using the method of moving asymptotes and finite element tools, an efficient technique has been developed to compute the composition profile by minimising the Gibbs free energy in self-assembled alloy quantum dot. In this paper, the composition of dome-shaped CexSi1-x/Si quantum dot is optimized, and the contribution of the different energy to equilibrium composition is discussed. The effect of composition on the critical size for shape transition of pyramid-shaped GeSi quantum dot is also studied.

SEQUENTIAL CONVEX PROGRAMMING METHODS FOR SOLVING LARGE TOPOLOGY OPTIMIZATION PROBLEMS： IMPLEMENTATION AND COMPUTATIONAL RESULTS

In this paper, we describe a method to solve large-scale structural optimization problems by sequential convex programming （SCP）. A predictor-corrector interior point method is applied to solve the strictly convex subproblems. The SCP algorithm and the topology optimization approach are introduced. Especially, different strategies to solve certain linear systems of equations are analyzed. Numerical results are presented to show the efficiency of the proposed method for solving topology optimization problems and to compare different variants.

Hybrid algorithms for handling the numerical noise in topology optimization

This paper presents new hybrid methods for the identification of optimal topologies by combining the teaching-learning based optimization(TLBO)and the method of moving asymptotes(MMA).The topology optimization problem is parameterizing with a low dimensional explicit method called moving morphable components(MMC),to make the use of evolutionary algorithms more efficient.Gradient-based solvers have good performance in solving large-scale topology optimization problems.However,in unconventional cases same as crashworthiness design in which there is numerical noise in the gradient information,the uses of these algorithms are unsuitable.The standard evolutionary algorithms can solve such problems since they don’t need gradient information.However,they have a high computational cost.This paper is based upon the idea of combining metaheuristics with mathematical programming to handle the probable noises and have faster convergence speed.Due to the ease of computations,the compliance minimization problem is considered as the case study and the artificial noise is added in gradient information.