DECOMPOSITION PROCEDURE FOR LARGE-SCALE OPTIMUM PLASTIC DESIGN PROBLEMS.

Ikuyo Kaneko, Cu Duong Ha

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

A decomposition procedure is proposed for solving a class of large-scale optimum design problems for perfectly-plastic structures under several alternative loading conditions. The conventional finite element method is used to cast the problem into a finite dimensional constrained nonlinear programming problem. The natural idea to deal with the large-scale structural problem is somehow to decompose the problem into a collection of small-size problems such of which represents an analysis of the behavior of each finite element under a single loading condition. This paper proposes one such way of decomposition based on duality theory and a recently developed iterative algorithm called the proximal point algorithm.

Original language English 873-889 17 International Journal for Numerical Methods in Engineering 19 6 Published - 1983 Jun Yes

Fingerprint

Plastics
Decomposition
Decompose
Nonlinear programming
Finite element method
Proximal Point Algorithm
Duality Theory
Nonlinear Programming
Iterative Algorithm
Design
Finite Element Method
Finite Element
Alternatives
Optimum design

ASJC Scopus subject areas

• Engineering (miscellaneous)
• Computational Mechanics
• Applied Mathematics

Cite this

DECOMPOSITION PROCEDURE FOR LARGE-SCALE OPTIMUM PLASTIC DESIGN PROBLEMS. / Kaneko, Ikuyo; Ha, Cu Duong.

In: International Journal for Numerical Methods in Engineering, Vol. 19, No. 6, 06.1983, p. 873-889.

Research output: Contribution to journalArticle

@article{0ff0507dc0554a3db1fee1e71f78fe4d,
title = "DECOMPOSITION PROCEDURE FOR LARGE-SCALE OPTIMUM PLASTIC DESIGN PROBLEMS.",
abstract = "A decomposition procedure is proposed for solving a class of large-scale optimum design problems for perfectly-plastic structures under several alternative loading conditions. The conventional finite element method is used to cast the problem into a finite dimensional constrained nonlinear programming problem. The natural idea to deal with the large-scale structural problem is somehow to decompose the problem into a collection of small-size problems such of which represents an analysis of the behavior of each finite element under a single loading condition. This paper proposes one such way of decomposition based on duality theory and a recently developed iterative algorithm called the proximal point algorithm.",
author = "Ikuyo Kaneko and Ha, {Cu Duong}",
year = "1983",
month = "6",
language = "English",
volume = "19",
pages = "873--889",
journal = "International Journal for Numerical Methods in Engineering",
issn = "0029-5981",
publisher = "John Wiley and Sons Ltd",
number = "6",

}

TY - JOUR

T1 - DECOMPOSITION PROCEDURE FOR LARGE-SCALE OPTIMUM PLASTIC DESIGN PROBLEMS.

AU - Kaneko, Ikuyo

AU - Ha, Cu Duong

PY - 1983/6

Y1 - 1983/6

N2 - A decomposition procedure is proposed for solving a class of large-scale optimum design problems for perfectly-plastic structures under several alternative loading conditions. The conventional finite element method is used to cast the problem into a finite dimensional constrained nonlinear programming problem. The natural idea to deal with the large-scale structural problem is somehow to decompose the problem into a collection of small-size problems such of which represents an analysis of the behavior of each finite element under a single loading condition. This paper proposes one such way of decomposition based on duality theory and a recently developed iterative algorithm called the proximal point algorithm.

AB - A decomposition procedure is proposed for solving a class of large-scale optimum design problems for perfectly-plastic structures under several alternative loading conditions. The conventional finite element method is used to cast the problem into a finite dimensional constrained nonlinear programming problem. The natural idea to deal with the large-scale structural problem is somehow to decompose the problem into a collection of small-size problems such of which represents an analysis of the behavior of each finite element under a single loading condition. This paper proposes one such way of decomposition based on duality theory and a recently developed iterative algorithm called the proximal point algorithm.

UR - http://www.scopus.com/inward/record.url?scp=0020764212&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020764212&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0020764212

VL - 19

SP - 873

EP - 889

JO - International Journal for Numerical Methods in Engineering

JF - International Journal for Numerical Methods in Engineering

SN - 0029-5981

IS - 6

ER -