2002
DOI: 10.1002/nme.551
|View full text |Cite
|
Sign up to set email alerts
|

A general non‐linear optimization algorithm for lower bound limit analysis

Abstract: SUMMARYThe non-linear programming problem associated with the discrete lower bound limit analysis problem is treated by means of an algorithm where the need to linearize the yield criteria is avoided. The algorithm is an interior point method and is completely general in the sense that no particular ÿnite element discretization or yield criterion is required. As with interior point methods for linear programming the number of iterations is a ected only little by the problem size.Some practical implementation i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

5
103
1
6

Year Published

2007
2007
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 162 publications
(115 citation statements)
references
References 14 publications
5
103
1
6
Order By: Relevance
“…Due to the linearity of the first two equations of (20), it is possible that the primal and dual residuals are always zero if the initial point…”
Section: Solving the Perturbed Kkt Systemmentioning
confidence: 99%
See 1 more Smart Citation
“…Due to the linearity of the first two equations of (20), it is possible that the primal and dual residuals are always zero if the initial point…”
Section: Solving the Perturbed Kkt Systemmentioning
confidence: 99%
“…Regularization methods have indeed first been proposed [13,14] until Augmented Lagrangian techniques became more appropriate [5,15,16]. Since the development of the IPM in the mathematical programming community [17], linear and non-linear convex optimization problems can now be efficiently solved and it became the state-of-the-art method in the field of computational limit analysis [18][19][20][21].…”
Section: Introductionmentioning
confidence: 99%
“…Specialized implementations of these algorithms in plastic problems can be found in [16] [17]. This method also furnishes the solution of the dual problem, namely the Lagrange multipliers of the functional…”
Section: Plastic Collapse Analysismentioning
confidence: 99%
“…This problem was introduced to illustrate locking phenomena by Nagtegaal et al [54] and became a popular benchmark test for plastic analysis procedures, particularly for rigid-plastic limit analysis [2,3,5,55,56]. The test problem consists of a rectangular specimen with two external thin symmetric cuts under in-plane tensile stresses τ 0 , as shown in Figure 9.…”
Section: Double Notched Tensile Specimenmentioning
confidence: 99%
“…Various numerical procedures based on the finite element method have been developed to solve real-world problems in engineering practice [1][2][3][4][5]. Owing to their simplicity, low-order finite elements are often used in these procedures.…”
Section: Introductionmentioning
confidence: 99%