A decomposition procedure for large‐scale optimum plastic design problems

DOI10.1002/nme.1620190609zbMath0509.73102OpenAlexW2088615932MaRDI QIDQ4749377

Cu Duong Ha, Ikuyo Kaneko

Publication date: 1983

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.1620190609

zbMATH Keywords

iterative algorithmduality theoryproximal point algorithmdecomposition procedurealternative loading conditionsbehaviour of each finite element under single loading conditionclass of large-scale optimum design problemscollection of small-size problemsfinite dimensional constrained nonlinear programming problemlarge-scale structural problemperfectly-plastic structures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Finite element methods applied to problems in solid mechanics (74S05) Optimization problems in solid mechanics (74P99) Numerical and other methods in solid mechanics (74S99)

Related Items (2)

A unified mathematical programming formulation of strain driven and interior point algorithms for shakedown and limit analysis ⋮ AAR-based decomposition algorithm for non-linear convex optimisation

Cites Work

• Optimum design methods for multiple loading
• Unnamed Item
• Unnamed Item

This page was built for publication: A decomposition procedure for large‐scale optimum plastic design problems