Despite the recent progress in optimisation techniques, finite-element stability analysis of realistic three-dimensional problems is still hampered by the size of the resulting optimisation problem. Current solvers may take a prohibitive computational time, if they give a solution at all. The possible remedies to this are the design of adaptive de-remeshing techniques, decomposition of the system of equations or of the optimisation problem. This paper concentrates on the last approach, and presents an algorithm especially suited for limit analysis. Optimisation problems in limit analysis are in general convex but non-linear. This fact renders the design of decomposition techniques specially challenging. The efficiency of general approaches such as Benders or Dantzig–Wolfe is not always satisfactory, and strongly depends on the structure of the optimisation problem. This work presents a new method that is based on rewriting the feasibility region of the global optimisation problem as the intersection of two subsets. By resorting to the averaged alternating reflections (AAR) method in order to find the distance between the sets, the optimisation problem is successfully solved in a decomposed manner. Some representative examples illustrate the application of the method and its efficiency with respect to other well-known decomposition algorithms.

Peer Reviewed