A globally convergent version of the method of moving asymptotes

The method of moving asymptotes (MMA) which is known to work excellently for solving structural optimization problems has one main disadvantage: convergence cannot be guaranteed and in practical use this fact sometimes leads to unsatisfactory results. In this paper we prove a global convergence theorem for a new method which consists iteratively of the solution of the known MMA-subproblem and a line search performed afterwards.