Name
Abstract | ||
|---|---|---|
Direct methods provide elegant and efficient approaches for the prediction of the long-term behaviour of engineering structures under arbitrary complex loading independent of the number of loading cycles. The lower bound direct method leads to a constrained non-linear convex problem in conjunction with finite element methods, which necessitates a very large number of optimization variables and a large amount of computer memory. To solve this large-scale optimization problem, we first reformulate it in a simpler equivalent convex program with easily exploitable sparsity structure. The interior point with DC regularization algorithm (IPDCA) using quasi definite matrix techniques is then used for its solution. The numerical results obtained by this algorithm will be compared with those obtained by general standard code Lancelot. They show the robustness, the efficiency of IPDCA and in particular its great superiority with respect to Lancelot. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s10898-006-9069-1 | J. Global Optimization |
Keywords | Field | DocType |
Engineering structures,Direct method,Finite element methods,DC programming,DC regularization algorithm,Interior point methods,DC regularization techniques | Direct method,Mathematical optimization,Direct methods,Upper and lower bounds,Finite element method,Robustness (computer science),Convex optimization,Interior point method,Optimization problem,Mathematics | Journal |
Volume | Issue | ISSN |
37 | 4 | 0925-5001 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akoa François | 1 | 0 | 0.34 |
| Hachemi Abdelkader | 2 | 0 | 0.34 |
| Le An Thi | 3 | 394 | 44.90 |
| Mouhtamid Said | 4 | 0 | 0.34 |
| Pham Dinh Tao | 5 | 1340 | 104.84 |