The method of moving asymptotes—a new method for structural optimization

Abstract A new method for non‐linear programming in general and structural optimization in particular is presented. In each step of the iterative process, a strictly convex approximating subproblem is generated and solved. The generation of these subproblems is controlled by so called ‘moving asymptotes’, which may both stabilize and speed up the convergence of the general process.