A new algorithm for structural optimization problems
Conference
·
OSTI ID:35900
To reduce the computational cost of structural optimization problems, a common procedure is to generate a sequence of convex approximate subproblems and solve them in an iterative fashion. In this presentation, a new local function approximation algorithm is proposed to formulate the subproblems. This new algorithm, called Generalized Convex Approximation (GCA), uses the sensitivity information of the current and previous design points to generate a sequence of convex, separable subproblems. This algorithm gives very good local approximations and leads to faster convergence for structural optimization problems. Several numerical results of structural optimization problems are presented.
- OSTI ID:
- 35900
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Sequential quadratic programming algorithms for optimization
New advances in the GOP algorithm for global optimization
Parallel algorithms for unconstrained optimization by multisplitting with inexact subspace search - the abstract
Technical Report
·
Tue Aug 01 00:00:00 EDT 1989
·
OSTI ID:5325989
New advances in the GOP algorithm for global optimization
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36016
Parallel algorithms for unconstrained optimization by multisplitting with inexact subspace search - the abstract
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:223839