Lower bound limit analysis of cohesive-frictional materials using second-order cone programming.
Lower bound limit analysis of cohesive-frictional materials using second-order cone programming.
The formulation of limit analysis by means of the finite element method leads to an optimization problem with a large number of variables and constraints. Here we present a method for obtaining strict lower bound solutions using second-order cone programming (SOCP), for which efficient primal-dual interior-point algorithms have recently been developed. Following a review of previous work, we provide a brief introduction to SOCP and describe how lower bound limit analysis can be formulated in this way. Some methods for exploiting the data structure of the problem are also described, including an efficient strategy for detecting and removing linearly dependent constraints at the assembly stage. The benefits of employing SOCP are then illustrated with numerical examples. Through the use of an effective algorithm/software, very large optimization problems with up to 700000 variables are solved in minutes on a desktop machine. The numerical examples concern plane strain conditions and the Mohr–Coulomb criterion, however we show that SOCP can also be applied to any other problem of lower bound limit analysis involving a yield function with a conic quadratic form (notable examples being the Drucker–Prager criterion in 2D or 3D, and Nielsen’s criterion for plates).
limit analysis, lower bound, cohesive-frictional, finite element, optimization, conic programming
604-634
Makrodimopoulos, A.
ba87ad2d-2351-4bd4-bd22-de921b3a8070
Martin, C.M.
0e7cd727-c254-4d4e-af61-7704dff627d0
23 April 2006
Makrodimopoulos, A.
ba87ad2d-2351-4bd4-bd22-de921b3a8070
Martin, C.M.
0e7cd727-c254-4d4e-af61-7704dff627d0
Makrodimopoulos, A. and Martin, C.M.
(2006)
Lower bound limit analysis of cohesive-frictional materials using second-order cone programming.
International Journal for Numerical Methods in Engineering, 66 (4), .
(doi:10.1002/nme.1567).
Abstract
The formulation of limit analysis by means of the finite element method leads to an optimization problem with a large number of variables and constraints. Here we present a method for obtaining strict lower bound solutions using second-order cone programming (SOCP), for which efficient primal-dual interior-point algorithms have recently been developed. Following a review of previous work, we provide a brief introduction to SOCP and describe how lower bound limit analysis can be formulated in this way. Some methods for exploiting the data structure of the problem are also described, including an efficient strategy for detecting and removing linearly dependent constraints at the assembly stage. The benefits of employing SOCP are then illustrated with numerical examples. Through the use of an effective algorithm/software, very large optimization problems with up to 700000 variables are solved in minutes on a desktop machine. The numerical examples concern plane strain conditions and the Mohr–Coulomb criterion, however we show that SOCP can also be applied to any other problem of lower bound limit analysis involving a yield function with a conic quadratic form (notable examples being the Drucker–Prager criterion in 2D or 3D, and Nielsen’s criterion for plates).
This record has no associated files available for download.
More information
Published date: 23 April 2006
Keywords:
limit analysis, lower bound, cohesive-frictional, finite element, optimization, conic programming
Identifiers
Local EPrints ID: 48048
URI: http://eprints.soton.ac.uk/id/eprint/48048
ISSN: 0029-5981
PURE UUID: 125477ef-aeb7-4164-bc41-29ff81593ae7
Catalogue record
Date deposited: 07 Sep 2007
Last modified: 15 Mar 2024 09:42
Export record
Altmetrics
Contributors
Author:
A. Makrodimopoulos
Author:
C.M. Martin
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics