2011
DOI: 10.1007/s11081-011-9144-4
|View full text |Cite
|
Sign up to set email alerts
|

Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
36
0
1

Year Published

2013
2013
2019
2019

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 39 publications
(37 citation statements)
references
References 48 publications
0
36
0
1
Order By: Relevance
“…We note that in recent work, Krabbenhoft et al [66] solved the primal problem by an interior point method, and Wieners [67] and Bilotta et al [1] by a sequential quadratic programming approach. When c is quadratic (corresponding to linear elastic and linear hardening models) and when the yield function is of the form of a 2-norm (as is the case with the von Mises function), then Equation (2) can be recast as a second order cone program (SOCP) [5]. This can in turn be reformulated as a semi-definite program [68], which can be solved by efficient interior point methods that have been recently developed.…”
Section: Primal Problem Of Incremental State Updatementioning
confidence: 99%
See 1 more Smart Citation
“…We note that in recent work, Krabbenhoft et al [66] solved the primal problem by an interior point method, and Wieners [67] and Bilotta et al [1] by a sequential quadratic programming approach. When c is quadratic (corresponding to linear elastic and linear hardening models) and when the yield function is of the form of a 2-norm (as is the case with the von Mises function), then Equation (2) can be recast as a second order cone program (SOCP) [5]. This can in turn be reformulated as a semi-definite program [68], which can be solved by efficient interior point methods that have been recently developed.…”
Section: Primal Problem Of Incremental State Updatementioning
confidence: 99%
“…In recent years, there has been renewed interest in application of mathematical programming approaches to nonlinear mechanics problems [1][2][3][4][5][6], fueled by advances in optimization algorithms and solvers. These approaches build on generalizations of classical energy theorems [7][8][9][10][11], on the one hand, and upper-bound and lower-bound theorems [12][13][14][15][16][17][18][19] and shakedown theorems [20][21][22] on the other.…”
Section: Introductionmentioning
confidence: 99%
“…See, for example, Alizadeh and Goldfarb [17] and Anjos and Lasserre [18] for fundamentals of SOCP; applications of SOCP in applied mechanics and structural engineering are found in [37][38][39][40]. Note that the constraints in (12b) are called second-order cone constraints.…”
Section: Discrete Damping Coefficientsmentioning
confidence: 99%
“…A continuous optimization problem with a linear objective function and some second-order cone constraints are called an SOCP problem. See, for example, Alizadeh and Goldfarb [17] and Anjos and Lasserre [18] for fundamentals of SOCP; applications of SOCP in applied mechanics and structural engineering are found in [37][38][39][40].…”
Section: Discrete Damping Coefficientsmentioning
confidence: 99%
“…The main operation is to recast the quadratic terms in the objective function to linear ones, subject to a quadratic constraint, and to reform the yield function as a cone. Owing to the attractive advantages presented in the introduction, a variety of mechanics problems have been formulated and solved in such a manner, including computational limit analysis of solids and plates [39][40][41], static/dynamic analysis of elastoplastic frames and solids [19,[42][43][44], analysis of steady-state non-Newtonian fluid flows [45], consolidation analysis [21] and the analysis of granular contact dynamics [38,46,47]. 973…”
mentioning
confidence: 99%