A study of mathematical programmingmethods for structural optimization. Part II: Numerical results

Ashok D. Belegundu, Jasbir S. Arora

Research output: Contribution to journalArticle

43 Citations (Scopus)

Abstract

Various mathematical programming methods for structural optimization are studied. In a companion paper, these methods have been studied based on certain theoretical considerations. In this paper, the methods are studied based on solving a set of test problems. The methods that are studied include recursive QP, feasible directions, gradient projection, SUMT and multiplier methods. Various computer codes have been developed, and are studied together with some existing programs such as CONMIN and OPTDYN. The test problems considered have 3–47 design variables and 3–252 constraints. The evaluation criteria consist of studying the accuracy, reliability and efficiency of a code. It turns out that globally convergent algorithms (multiplier methods, in particular) are very reliable but not efficient. Primal algorithms (like CONMIN), which are not proved to be globally convergent, are efficient but not reliable.

Original languageEnglish (US)
Pages (from-to)1601-1623
Number of pages23
JournalInternational Journal for Numerical Methods in Engineering
Volume21
Issue number9
DOIs
StatePublished - Sep 1985

Fingerprint

Structural optimization
Structural Optimization
Multiplier Method
Numerical Results
Mathematical programming
Test Problems
Gradient Projection Method
Mathematical Programming
Evaluation

All Science Journal Classification (ASJC) codes

  • Numerical Analysis
  • Engineering(all)
  • Applied Mathematics

Cite this

@article{bde5423492f94957a94a311c9825efdb,
title = "A study of mathematical programmingmethods for structural optimization. Part II: Numerical results",
abstract = "Various mathematical programming methods for structural optimization are studied. In a companion paper, these methods have been studied based on certain theoretical considerations. In this paper, the methods are studied based on solving a set of test problems. The methods that are studied include recursive QP, feasible directions, gradient projection, SUMT and multiplier methods. Various computer codes have been developed, and are studied together with some existing programs such as CONMIN and OPTDYN. The test problems considered have 3–47 design variables and 3–252 constraints. The evaluation criteria consist of studying the accuracy, reliability and efficiency of a code. It turns out that globally convergent algorithms (multiplier methods, in particular) are very reliable but not efficient. Primal algorithms (like CONMIN), which are not proved to be globally convergent, are efficient but not reliable.",
author = "Belegundu, {Ashok D.} and Arora, {Jasbir S.}",
year = "1985",
month = "9",
doi = "10.1002/nme.1620210905",
language = "English (US)",
volume = "21",
pages = "1601--1623",
journal = "International Journal for Numerical Methods in Engineering",
issn = "0029-5981",
publisher = "John Wiley and Sons Ltd",
number = "9",

}

A study of mathematical programmingmethods for structural optimization. Part II : Numerical results. / Belegundu, Ashok D.; Arora, Jasbir S.

In: International Journal for Numerical Methods in Engineering, Vol. 21, No. 9, 09.1985, p. 1601-1623.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A study of mathematical programmingmethods for structural optimization. Part II

T2 - Numerical results

AU - Belegundu, Ashok D.

AU - Arora, Jasbir S.

PY - 1985/9

Y1 - 1985/9

N2 - Various mathematical programming methods for structural optimization are studied. In a companion paper, these methods have been studied based on certain theoretical considerations. In this paper, the methods are studied based on solving a set of test problems. The methods that are studied include recursive QP, feasible directions, gradient projection, SUMT and multiplier methods. Various computer codes have been developed, and are studied together with some existing programs such as CONMIN and OPTDYN. The test problems considered have 3–47 design variables and 3–252 constraints. The evaluation criteria consist of studying the accuracy, reliability and efficiency of a code. It turns out that globally convergent algorithms (multiplier methods, in particular) are very reliable but not efficient. Primal algorithms (like CONMIN), which are not proved to be globally convergent, are efficient but not reliable.

AB - Various mathematical programming methods for structural optimization are studied. In a companion paper, these methods have been studied based on certain theoretical considerations. In this paper, the methods are studied based on solving a set of test problems. The methods that are studied include recursive QP, feasible directions, gradient projection, SUMT and multiplier methods. Various computer codes have been developed, and are studied together with some existing programs such as CONMIN and OPTDYN. The test problems considered have 3–47 design variables and 3–252 constraints. The evaluation criteria consist of studying the accuracy, reliability and efficiency of a code. It turns out that globally convergent algorithms (multiplier methods, in particular) are very reliable but not efficient. Primal algorithms (like CONMIN), which are not proved to be globally convergent, are efficient but not reliable.

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

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

U2 - 10.1002/nme.1620210905

DO - 10.1002/nme.1620210905

M3 - Article

AN - SCOPUS:0022131029

VL - 21

SP - 1601

EP - 1623

JO - International Journal for Numerical Methods in Engineering

JF - International Journal for Numerical Methods in Engineering

SN - 0029-5981

IS - 9

ER -