An SLP algorithm and its application to topology optimization

Francisco A. M. Gomes; Thadeu A. Senne

Advanced search

Search - Use quotation marks to get a more specific result

Index

Field of knowledge

Start date

Betweenand

(Reference retrieved automatically from SciELO through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

An SLP algorithm and its application to topology optimization

Full text
Author(s):	Francisco A. M. Gomes ^[1] ; Thadeu A. Senne ^[2] Total Authors: 2
Affiliation:	^[1] Universidade Estadual de Campinas. Departamento de Matemática Aplicada - Brasil ^[2] Universidade Estadual de Campinas. Departamento de Matemática Aplicada - Brasil Total Affiliations: 2
Document type:	Journal article
Source:	COMPUTATIONAL & APPLIED MATHEMATICS; v. 30, n. 1, p. 53-89, 2011-00-00.
Abstract
We introduce a globally convergent sequential linear programming method for nonlinear programming. The algorithm is applied to the solution of classic topology optimization problems, as well as to the design of compliantmechanisms. The numerical results suggest that the new algorithm is faster than the globally convergent version of the method of moving asymptotes, a popular method for mechanical engineering applications proposed by Svanberg. (AU)

FAPESP's process:	06/53768-0 - Computational methods of optimization
Grantee:	José Mário Martinez Perez
Support Opportunities:	Research Projects - Thematic Grants

Short URL