An SLP algorithm and its application to topology optimization

Detalhes bibliográficos
Autor(a) principal: Gomes,Francisco A. M.
Data de Publicação: 2011
Outros Autores: Senne,Thadeu A.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Computational & Applied Mathematics
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022011000100004
Resumo: 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.
id SBMAC-2_cca0a811e65787b02fa746d36532dd26
oai_identifier_str oai:scielo:S1807-03022011000100004
network_acronym_str SBMAC-2
network_name_str Computational & Applied Mathematics
repository_id_str
spelling An SLP algorithm and its application to topology optimizationtopology optimizationcompliant mechanismssequential linear programmingglobal convergence theoryWe 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.Sociedade Brasileira de Matemática Aplicada e Computacional2011-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022011000100004Computational & Applied Mathematics v.30 n.1 2011reponame:Computational & Applied Mathematicsinstname:Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC)instacron:SBMAC10.1590/S1807-03022011000100004info:eu-repo/semantics/openAccessGomes,Francisco A. M.Senne,Thadeu A.eng2011-03-22T00:00:00Zoai:scielo:S1807-03022011000100004Revistahttps://www.scielo.br/j/cam/ONGhttps://old.scielo.br/oai/scielo-oai.php||sbmac@sbmac.org.br1807-03022238-3603opendoar:2011-03-22T00:00Computational & Applied Mathematics - Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC)false
dc.title.none.fl_str_mv An SLP algorithm and its application to topology optimization
title An SLP algorithm and its application to topology optimization
spellingShingle An SLP algorithm and its application to topology optimization
Gomes,Francisco A. M.
topology optimization
compliant mechanisms
sequential linear programming
global convergence theory
title_short An SLP algorithm and its application to topology optimization
title_full An SLP algorithm and its application to topology optimization
title_fullStr An SLP algorithm and its application to topology optimization
title_full_unstemmed An SLP algorithm and its application to topology optimization
title_sort An SLP algorithm and its application to topology optimization
author Gomes,Francisco A. M.
author_facet Gomes,Francisco A. M.
Senne,Thadeu A.
author_role author
author2 Senne,Thadeu A.
author2_role author
dc.contributor.author.fl_str_mv Gomes,Francisco A. M.
Senne,Thadeu A.
dc.subject.por.fl_str_mv topology optimization
compliant mechanisms
sequential linear programming
global convergence theory
topic topology optimization
compliant mechanisms
sequential linear programming
global convergence theory
description 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.
publishDate 2011
dc.date.none.fl_str_mv 2011-01-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022011000100004
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022011000100004
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S1807-03022011000100004
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Matemática Aplicada e Computacional
publisher.none.fl_str_mv Sociedade Brasileira de Matemática Aplicada e Computacional
dc.source.none.fl_str_mv Computational & Applied Mathematics v.30 n.1 2011
reponame:Computational & Applied Mathematics
instname:Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC)
instacron:SBMAC
instname_str Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC)
instacron_str SBMAC
institution SBMAC
reponame_str Computational & Applied Mathematics
collection Computational & Applied Mathematics
repository.name.fl_str_mv Computational & Applied Mathematics - Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC)
repository.mail.fl_str_mv ||sbmac@sbmac.org.br
_version_ 1754734890231791616

Registros relacionados