2007
DOI: 10.1016/j.ijsolstr.2006.06.036
|View full text |Cite
|
Sign up to set email alerts
|

Formulation and solution of some plasticity problems as conic programs

Abstract: The application of conic programming to some traditionally difficult plasticity problems is considered. Convenient standard forms for conic programming of both limit and incremental elastoplastic analysis are given. The types of yield criteria that can be treated by conic programming is discussed and it is shown that the three-dimensional Mohr-Coulomb criterion can be cast as a set of conic constraints, thus facilitating efficient treatment by dedicated algorithms. Finally, the performance of a number of mixed… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
168
0
8

Year Published

2007
2007
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 277 publications
(176 citation statements)
references
References 24 publications
0
168
0
8
Order By: Relevance
“…A primal-dual interior-point SOCP algorithm can efficiently solve problems involving linear or conic constraints. This algorithm is of particular interest in the field of limit analysis since most plasticity problems can be formulated as conic programming problems [22].…”
Section: Numerical Examplesmentioning
confidence: 99%
See 1 more Smart Citation
“…A primal-dual interior-point SOCP algorithm can efficiently solve problems involving linear or conic constraints. This algorithm is of particular interest in the field of limit analysis since most plasticity problems can be formulated as conic programming problems [22].…”
Section: Numerical Examplesmentioning
confidence: 99%
“…One of the most efficient algorithms to overcome this difficulty is the primal-dual interior-point method presented in [19,20] and implemented in commercial codes such as the Mosek software package. The limit analysis problem involving conic constraints can then be solved by this efficient algorithm [16,21,22].…”
Section: Introductionmentioning
confidence: 99%
“…The yield function f σ ( ) i is checked in the m points to ensure a safe stress field. For concrete, the Mohr-Coulomb yield criterion is commonly used which can be expressed as conic constraints [21,22].…”
Section: Acknowledgmentmentioning
confidence: 99%
“…It was recognized in [28] that most commonly used yield criteria can be cast in the form of conic constraints, and optimization problems involving such constraints can be solved using highly efficient solvers [15]. Consequently, several numerical limit analysis procedures which involve the use of cone programming techniques have been reported recently [9,29,30].…”
Section: Second-order Cone Programming (Socp)mentioning
confidence: 99%
“…It is assumed that the slab is isotropic with positive and negative yield moments m p in both directions (constant reinforcement). For this case, the yield criterion (2) may be represented as a square yield locus in the plane of the principal moments [28,34], and the exact solution has been identified by Fox [35] as…”
Section: Numerical Examplesmentioning
confidence: 99%