An inexact [script small l]1 penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity
We develop an optimization algorithm which is able to deal with inexact evaluations of the objective function. The proposed algorithm employs sequential quadratic programming with a line search that uses the [script small l]1 penalty function for an Armijo-like condition. Both the objective gradient...
Uloženo v:
| Vydáno v: | Optimization methods & software Ročník 28; číslo 5; s. 943 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Abingdon
Taylor & Francis Ltd
01.10.2013
|
| Témata: | |
| ISSN: | 1055-6788, 1029-4937 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We develop an optimization algorithm which is able to deal with inexact evaluations of the objective function. The proposed algorithm employs sequential quadratic programming with a line search that uses the [script small l]1 penalty function for an Armijo-like condition. Both the objective gradient computations for the quadratic subproblems and the objective function computations for the line search admit some inexactness which is controlled by the algorithm. We prove convergence results for the presented algorithm under suitable assumptions. The kind of optimization problems handled by the algorithm arises, for example, when we apply iterative solvers in the evaluation of the reduced objective function of a shape optimization problem subject to the linear elasticity equations. In the second part of this paper, we present an application of the algorithm to the shape optimization of steel profiles using nested iterations with adaptively refined meshes. It is shown how the inexactness in the algorithm translates to an acceptable residual of the state and adjoint state solutions in the iterative solver. We look at three different stopping criteria for the outer iterations. Numerical results are presented. [PUBLICATION ABSTRACT] |
|---|---|
| AbstractList | We develop an optimization algorithm which is able to deal with inexact evaluations of the objective function. The proposed algorithm employs sequential quadratic programming with a line search that uses the [script small l]1 penalty function for an Armijo-like condition. Both the objective gradient computations for the quadratic subproblems and the objective function computations for the line search admit some inexactness which is controlled by the algorithm. We prove convergence results for the presented algorithm under suitable assumptions. The kind of optimization problems handled by the algorithm arises, for example, when we apply iterative solvers in the evaluation of the reduced objective function of a shape optimization problem subject to the linear elasticity equations. In the second part of this paper, we present an application of the algorithm to the shape optimization of steel profiles using nested iterations with adaptively refined meshes. It is shown how the inexactness in the algorithm translates to an acceptable residual of the state and adjoint state solutions in the iterative solver. We look at three different stopping criteria for the outer iterations. Numerical results are presented. [PUBLICATION ABSTRACT] |
| Author | Hess, Wolfgang Ulbrich, Stefan |
| Author_xml | – sequence: 1 givenname: Wolfgang surname: Hess fullname: Hess, Wolfgang – sequence: 2 givenname: Stefan surname: Ulbrich fullname: Ulbrich, Stefan |
| BookMark | eNpVj89KAzEYxINUsK2-gYeA5635kt1N9lhq_QMFFfUkUr7dzdqUNFk3KVofwyd2S714mmH4zcCMyMB5pwk5BzYBptglsCzLpVITzgAmedaH_IgMgfEiSQshB3ufZcmeOSGjENaMsRTSfEh-po4ap7-wivQ1VJ1pIw0btJbaN6Ctdmjjjj49PlC0774zcbWhje_ow9U8qbwLscO-XlPfRrMx3xiNd_Szxyg6im1rTXXIoqdhha3-TxpHbd_HjmqLIZrKxN0pOW7QBn32p2Pycj1_nt0mi_ubu9l0kbQAIiaKVyVyqbAStZJQl7wESCHnjU4BtSpBImZ1IZocMedCypRpwVDKutRlwcWYXBx2285_bHWIy7Xfdv3hsOx3lChyYEL8AtBbbK4 |
| ContentType | Journal Article |
| Copyright | Copyright Taylor and Francis Group, LLC |
| Copyright_xml | – notice: Copyright Taylor and Francis Group, LLC |
| DBID | 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1080/10556788.2011.651082 |
| DatabaseName | Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1029-4937 |
| ExternalDocumentID | 3039214751 |
| Genre | Feature |
| GroupedDBID | .4S .7F .DC .QJ 0BK 0R~ 123 29N 30N 4.4 5VS 7SC 8FD AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR ABCCY ABDBF ABFIM ABHAV ABJNI ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACGEJ ACGFS ACIWK ACTIO ACUHS ADCVX ADGTB ADXPE AEISY AENEX AEOZL AEPSL AEYOC AFKVX AFRVT AGDLA AGMYJ AHDZW AIJEM AIYEW AJWEG AKBVH AKOOK ALMA_UNASSIGNED_HOLDINGS ALQZU AMVHM AQRUH ARCSS AVBZW AWYRJ BLEHA CCCUG CE4 CS3 DGEBU DKSSO DU5 EAP EBS EDO EMK EPL EST ESX E~A E~B F5P GTTXZ H13 HF~ HZ~ H~P I-F IPNFZ J.P JQ2 KYCEM L7M L~C L~D M4Z NA5 NY~ O9- P2P PQQKQ RIG RNANH ROSJB RTWRZ S-T SNACF TASJS TBQAZ TDBHL TEJ TFL TFT TFW TTHFI TUROJ TUS TWF UT5 UU3 ZGOLN ~S~ |
| ID | FETCH-LOGICAL-p113t-82cba278ac3d871db2b114162fe41ae8b17aa5d93f6aa6237740e30a77dbeb923 |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000322823700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1055-6788 |
| IngestDate | Wed Aug 13 10:57:59 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-p113t-82cba278ac3d871db2b114162fe41ae8b17aa5d93f6aa6237740e30a77dbeb923 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 1418396103 |
| PQPubID | 186278 |
| ParticipantIDs | proquest_journals_1418396103 |
| PublicationCentury | 2000 |
| PublicationDate | 20131001 |
| PublicationDateYYYYMMDD | 2013-10-01 |
| PublicationDate_xml | – month: 10 year: 2013 text: 20131001 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Abingdon |
| PublicationPlace_xml | – name: Abingdon |
| PublicationTitle | Optimization methods & software |
| PublicationYear | 2013 |
| Publisher | Taylor & Francis Ltd |
| Publisher_xml | – name: Taylor & Francis Ltd |
| SSID | ssj0004146 |
| Score | 1.9796395 |
| Snippet | We develop an optimization algorithm which is able to deal with inexact evaluations of the objective function. The proposed algorithm employs sequential... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| StartPage | 943 |
| SubjectTerms | Elasticity Fines & penalties Optimization algorithms |
| Title | An inexact [script small l]1 penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity |
| URI | https://www.proquest.com/docview/1418396103 |
| Volume | 28 |
| WOSCitedRecordID | wos000322823700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAWR databaseName: Taylor & Francis Journals Complete customDbUrl: eissn: 1029-4937 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004146 issn: 1055-6788 databaseCode: TFW dateStart: 19920101 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Nj9MwELXKwgEOiE8tsCAf6CkKxHESJ8dCW-2h6haRaishVDmJs62UpqEJS38Hf48_wzh2NilFCA5cosqxrLbzMn4Tz8xD6HWSuPIZ4xDkeJHpxJSaQRzFpnCSmDssZVTU3fUnbDr1F4tg1uv9aGphrjOW5_5-HxT_1dQwBsaWpbP_YO6bRWEAPoPR4Qpmh-tfGX4gcxfFXtY-9t13yisY5UYeQWd9d0iMQsAawL0_fpgZPLva7tbValOnG86GIzOWhFHqRgAT3YI_2ehCzaYKzugceUviWq54IQ5nrnNDkle-MwRwc5m2XR0cHl90JysJ67KGYAl7wjfepuOeCyXpfrnN0iuu91gYn2cRuO-VzlJLNcD1uwvSZsEptIVHMiKdXCbpjS1XVkYo3b83Qo_ZUhZPdYppXLjtd6DqdvxxoHpAHe0TKrGyFgeF5VUnVw_ckxJCOmzLPb1YjueTyTIcLcLDu4oGWEAxicNc0qfj4ospBc3kwX-fDhW4bqHbNnMD6YTD8WVbtKtL35rf2NR1-tbb332vI65QE6DwAbqvIxc8UIh7iHoif4TudfpZPkbfBznW2MOfFPJwjTycfSZY4w4D7vAN7jDgDv-CO9xFE5a4wzzHHdzhaotr3B3OXOdY4Q63uHuC5uNR-P7c1KIfZkEIrUzfjiNuM5_HNIFgPonsCEJ24tmpcAgXfkQY524S0NTjHLg7hC-WoBZnLIlEBOHKU3SSb3NxirCX2DZs5Zbrc-Y4kc0TkaYpBDAJdR1O2DN01vylS_0AlxAKy5gBggr6_M-3X6C7LaTP0Em1-ypeojvxdbUud69qW_8E4XCaGA |
| linkProvider | Taylor & Francis |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+inexact+%5Bscript+small+l%5D1+penalty+SQP+algorithm+for+PDE-constrained+optimization+with+an+application+to+shape+optimization+in+linear+elasticity&rft.jtitle=Optimization+methods+%26+software&rft.au=Hess%2C+Wolfgang&rft.au=Ulbrich%2C+Stefan&rft.date=2013-10-01&rft.pub=Taylor+%26+Francis+Ltd&rft.issn=1055-6788&rft.eissn=1029-4937&rft.volume=28&rft.issue=5&rft.spage=943&rft_id=info:doi/10.1080%2F10556788.2011.651082&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3039214751 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1055-6788&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1055-6788&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1055-6788&client=summon |