2020
DOI: 10.1016/j.compgeo.2020.103571
|View full text |Cite
|
Sign up to set email alerts
|

Lower and upper bound limit analysis via the alternating direction method of multipliers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
2
0

Year Published

2020
2020
2025
2025

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…Many scholars have done much work in this regard. For example, the two-stage quasi-Newton algorithm and alternating direction method of multipliers are effective methods for solving high degree of freedom nonlinear programming problems [16,17].…”
Section: Introductionmentioning
confidence: 99%
“…Many scholars have done much work in this regard. For example, the two-stage quasi-Newton algorithm and alternating direction method of multipliers are effective methods for solving high degree of freedom nonlinear programming problems [16,17].…”
Section: Introductionmentioning
confidence: 99%
“…However, as the displacement jumps vary quadratically, additional constraints 17,18 had to be applied in order to ensure that the flow rule is satisfied along the discontinuities. Either with or without discontinuities, the quadratic element has replaced the linear one in the most recent rigorous upper bound procedures 20,21 …”
Section: Introductionmentioning
confidence: 99%
“…There were various categories of computational approaches: those of large-scale linear programming [7,8], general convex nonlinear programming [6,9,10] and interior point algorithms adapted to the special form of the von Mises criterion [11]. Another recent development is the algorithm of da Silva et al [12] which is based on alternating multipliers. The formulations such as the second-order cone programming [13][14][15][16][17] led to the solution of highly discretized problems, providing tight lower and upper bounds, without the need of preparing algorithms, as it was sufficient to use the existing optimization software.…”
Section: Introductionmentioning
confidence: 99%