Decomposition techniques for computational limit analysis

Numerical techniques for the computation of strict bounds in limit analyses have been developed for more than thirty years. The efficiency of these techniques have been substantially improved in the last ten years, and have been successfully applied to academic problems, foundations and excavations. We here extend the theoretical background to problems with anchors, interface conditions, and joints. Those extensions are relevant for the analysis of retaining and anchored walls, which we study in this work. The analysis of three-dimensional domains remains as yet very scarce. From the computational standpoint, the memory requirements and CPU time are exceedingly prohibitive when mesh adaptivity is employed. For this reason, we also present here the application of decomposition techniques to the optimisation problem of limit analysis. We discuss the performance of different methodologies adopted in the literature for general optimisation problems, such as primal and dual decomposition, and suggest some strategies that are suitable for the parallelisation of large three-dimensional problems. The proposed decomposition techniques are tested against representative problems.

[1]  Antonio Huerta,et al.  Stability of anchored sheet wall in cohesive‐frictional soils by FE limit analysis , 2013 .

[2]  J. Bonet,et al.  A note on upper bound formulations in limit analysis , 2012 .

[3]  Bernd Grtner,et al.  Approximation Algorithms and Semidefinite Programming , 2012 .

[4]  Dinh Quoc Tran,et al.  Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems , 2011, Comput. Optim. Appl..

[5]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[6]  Zied Kammoun,et al.  Large static problem in numerical limit analysis: A decomposition approach , 2010 .

[7]  Antonio J. Conejo,et al.  A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints , 2010, J. Oper. Res. Soc..

[8]  Antonio Huerta,et al.  Upper and lower bounds in limit analysis: Adaptive meshing strategies and discontinuous loading , 2009 .

[9]  Johan A. K. Suykens,et al.  Application of a Smoothing Technique to Decomposition in Convex Optimization , 2008, IEEE Transactions on Automatic Control.

[10]  Armando N. Antão,et al.  Upper bound limit analysis with a parallel mixed finite element formulation , 2008 .

[11]  Jaime Peraire,et al.  Mesh adaptive computation of upper and lower bounds in limit analysis , 2008 .

[12]  Armando N. Antão,et al.  A non‐linear programming method approach for upper bound limit analysis , 2007 .

[13]  S. Sloan,et al.  Formulation and solution of some plasticity problems as conic programs , 2007 .

[14]  C. Martin,et al.  Lower bound limit analysis of cohesive‐frictional materials using second‐order cone programming , 2006 .

[15]  Scott W. Sloan,et al.  Lower bound limit analysis with adaptive remeshing , 2005 .

[16]  Yurii Nesterov,et al.  Smooth minimization of non-smooth functions , 2005, Math. Program..

[17]  D. Bertsekas.  6.253 Convex Analysis and Optimization, Spring 2010 , 2004 .

[18]  Heinz H. Bauschke,et al.  Finding best approximation pairs relative to two closed convex sets in Hilbert spaces , 2004, J. Approx. Theory.

[19]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[20]  Sheng Lin Di,et al.  A general rigid-plastic/rigid-viscoplastic FEM for metal-forming processes based on the potential reduction interior point method , 2003 .

[21]  Kim-Chuan Toh,et al.  Solving semidefinite-quadratic-linear programs using SDPT3 , 2003, Math. Program..

[22]  Erling D. Andersen,et al.  On implementing a primal-dual interior-point method for conic quadratic optimization , 2003, Math. Program..

[23]  Scott W. Sloan,et al.  Lower bound limit analysis using non‐linear programming , 2002 .

[24]  P. L. Combettes,et al.  Hilbertian convex feasibility problem: Convergence of projection methods , 1997 .

[25]  Heinz H. Bauschke,et al.  On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..

[26]  Patrick L. Combettes,et al.  Wavelet synthesis by alternating projections , 1996, IEEE Trans. Signal Process..

[27]  Patrick L. Combettes,et al.  Inconsistent signal feasibility problems: least-squares solutions in a product space , 1994, IEEE Trans. Signal Process..

[28]  Marc Teboulle,et al.  A proximal-based decomposition method for convex minimization problems , 1994, Math. Program..

[29]  Heinz H. Bauschke,et al.  On the convergence of von Neumann's alternating projection algorithm for two sets , 1993 .

[30]  R. Marks,et al.  Signal synthesis in the presence of an inconsistent set of constraints , 1985 .

[31]  Ikuyo Kaneko,et al.  A decomposition procedure for large-scale optimum plastic design problems , 1983 .

[32]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[33]  A. Pazy.  Asymptotic behavior of contractions in hilbert space , 1971 .

[34]  Z. Opial.  Weak convergence of the sequence of successive approximations for nonexpansive mappings , 1967 .

[35]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[36]  Renato D. C. Monteiro,et al.  Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems , 2014, Comput. Optim. Appl..

[37]  Kim-Chuan Toh,et al.  On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0 , 2012 .

[38]  E. Loute,et al.  Mixed method and convex optimization for limit analysis of homogeneous Gurson materials: a kinematical approach , 2009 .

[39]  Stephen P. Boyd,et al.  Notes on Decomposition Methods , 2008 .

[40]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[41]  Héctor,et al.  Computation of upper and lower bounds in limit analysis using second-order cone programming and mesh adaptivity , 2004 .

[42]  Stephen P. Boyd,et al.  Distributed optimization for cooperative agents: application to formation flight , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[43]  Kamran-Charles Vossoughi.  Étude numérique du comportement des ouvrages de soutènement à la rupture , 2001 .

[44]  F. Deutsch.  Best approximation in inner product spaces , 2001 .

[45]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[46]  E. Christiansen,et al.  Handbook of Numerical Analysis , 1996 .

[47]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[48]  Wai-Fah Chen,et al.  Limit analysis in soil mechanics , 1990 .

[49]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .