An efficient descent method for locally Lipschitz multiobjective optimization problems
In this article, we present an efficient descent method for locally Lipschitz continuous multiobjective optimization problems (MOPs). The method is realized by combining a theoretical result regarding the computation of descent directions for nonsmooth MOPs with a practical method to approximate the...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2020-04 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Gebken, Bennet Peitz, Sebastian |
| description | In this article, we present an efficient descent method for locally Lipschitz continuous multiobjective optimization problems (MOPs). The method is realized by combining a theoretical result regarding the computation of descent directions for nonsmooth MOPs with a practical method to approximate the subdifferentials of the objective functions. We show convergence to points which satisfy a necessary condition for Pareto optimality. Using a set of test problems, we compare our method to the multiobjective proximal bundle method by M\"akel\"a. The results indicate that our method is competitive while being easier to implement. While the number of objective function evaluations is larger, the overall number of subgradient evaluations is lower. Finally, we show that our method can be combined with a subdivision algorithm to compute entire Pareto sets of nonsmooth MOPs. |
| doi_str_mv | 10.48550/arxiv.2004.11578 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2004_11578</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2395073637</sourcerecordid><originalsourceid>FETCH-LOGICAL-a527-e39e15bf6e44d26bc910258f98cbd7fcf88f975dcb03aae9298e1d1bb2a6ce673</originalsourceid><addsrcrecordid>eNotj8tqwzAUREWh0JDmA7qqoGuneliWvAyhj4Chm9CtkeQromBbrqWEJl9fJ-lqhmEY5iD0RMkyV0KQVz3--uOSEZIvKRVS3aEZ45xmKmfsAS1i3BNCWCGZEHyGvlc9Bue89dAn3EC0F-0g7UKDXRhxG6xu2xOu_BDtzqcz7g5t8sHswSZ_BByG5Dt_1lPW42EMpoUuPqJ7p9sIi3-do-3723b9mVVfH5v1qsq0YDIDXgIVxhWQ5w0rjC0pYUK5UlnTSGedmrwUjTWEaw0lKxXQhhrDdGGhkHyOnm-zV-h6GH2nx1N9ga-v8FPj5daYnv0cIKZ6Hw5jP32qGS8Fkbzgkv8BNdhfCw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2395073637</pqid></control><display><type>article</type><title>An efficient descent method for locally Lipschitz multiobjective optimization problems</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Gebken, Bennet ; Peitz, Sebastian</creator><creatorcontrib>Gebken, Bennet ; Peitz, Sebastian</creatorcontrib><description>In this article, we present an efficient descent method for locally Lipschitz continuous multiobjective optimization problems (MOPs). The method is realized by combining a theoretical result regarding the computation of descent directions for nonsmooth MOPs with a practical method to approximate the subdifferentials of the objective functions. We show convergence to points which satisfy a necessary condition for Pareto optimality. Using a set of test problems, we compare our method to the multiobjective proximal bundle method by M\"akel\"a. The results indicate that our method is competitive while being easier to implement. While the number of objective function evaluations is larger, the overall number of subgradient evaluations is lower. Finally, we show that our method can be combined with a subdivision algorithm to compute entire Pareto sets of nonsmooth MOPs.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2004.11578</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Descent ; Mathematical programming ; Mathematics - Optimization and Control ; Mopping ; Multiple objective analysis ; Pareto optimization ; Pareto optimum</subject><ispartof>arXiv.org, 2020-04</ispartof><rights>2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2004.11578$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.1007/s10957-020-01803-w$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Gebken, Bennet</creatorcontrib><creatorcontrib>Peitz, Sebastian</creatorcontrib><title>An efficient descent method for locally Lipschitz multiobjective optimization problems</title><title>arXiv.org</title><description>In this article, we present an efficient descent method for locally Lipschitz continuous multiobjective optimization problems (MOPs). The method is realized by combining a theoretical result regarding the computation of descent directions for nonsmooth MOPs with a practical method to approximate the subdifferentials of the objective functions. We show convergence to points which satisfy a necessary condition for Pareto optimality. Using a set of test problems, we compare our method to the multiobjective proximal bundle method by M\"akel\"a. The results indicate that our method is competitive while being easier to implement. While the number of objective function evaluations is larger, the overall number of subgradient evaluations is lower. Finally, we show that our method can be combined with a subdivision algorithm to compute entire Pareto sets of nonsmooth MOPs.</description><subject>Algorithms</subject><subject>Descent</subject><subject>Mathematical programming</subject><subject>Mathematics - Optimization and Control</subject><subject>Mopping</subject><subject>Multiple objective analysis</subject><subject>Pareto optimization</subject><subject>Pareto optimum</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj8tqwzAUREWh0JDmA7qqoGuneliWvAyhj4Chm9CtkeQromBbrqWEJl9fJ-lqhmEY5iD0RMkyV0KQVz3--uOSEZIvKRVS3aEZ45xmKmfsAS1i3BNCWCGZEHyGvlc9Bue89dAn3EC0F-0g7UKDXRhxG6xu2xOu_BDtzqcz7g5t8sHswSZ_BByG5Dt_1lPW42EMpoUuPqJ7p9sIi3-do-3723b9mVVfH5v1qsq0YDIDXgIVxhWQ5w0rjC0pYUK5UlnTSGedmrwUjTWEaw0lKxXQhhrDdGGhkHyOnm-zV-h6GH2nx1N9ga-v8FPj5daYnv0cIKZ6Hw5jP32qGS8Fkbzgkv8BNdhfCw</recordid><startdate>20200424</startdate><enddate>20200424</enddate><creator>Gebken, Bennet</creator><creator>Peitz, Sebastian</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20200424</creationdate><title>An efficient descent method for locally Lipschitz multiobjective optimization problems</title><author>Gebken, Bennet ; Peitz, Sebastian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a527-e39e15bf6e44d26bc910258f98cbd7fcf88f975dcb03aae9298e1d1bb2a6ce673</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Descent</topic><topic>Mathematical programming</topic><topic>Mathematics - Optimization and Control</topic><topic>Mopping</topic><topic>Multiple objective analysis</topic><topic>Pareto optimization</topic><topic>Pareto optimum</topic><toplevel>online_resources</toplevel><creatorcontrib>Gebken, Bennet</creatorcontrib><creatorcontrib>Peitz, Sebastian</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Gebken, Bennet</au><au>Peitz, Sebastian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An efficient descent method for locally Lipschitz multiobjective optimization problems</atitle><jtitle>arXiv.org</jtitle><date>2020-04-24</date><risdate>2020</risdate><eissn>2331-8422</eissn><abstract>In this article, we present an efficient descent method for locally Lipschitz continuous multiobjective optimization problems (MOPs). The method is realized by combining a theoretical result regarding the computation of descent directions for nonsmooth MOPs with a practical method to approximate the subdifferentials of the objective functions. We show convergence to points which satisfy a necessary condition for Pareto optimality. Using a set of test problems, we compare our method to the multiobjective proximal bundle method by M\"akel\"a. The results indicate that our method is competitive while being easier to implement. While the number of objective function evaluations is larger, the overall number of subgradient evaluations is lower. Finally, we show that our method can be combined with a subdivision algorithm to compute entire Pareto sets of nonsmooth MOPs.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2004.11578</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2020-04 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_2004_11578 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Descent Mathematical programming Mathematics - Optimization and Control Mopping Multiple objective analysis Pareto optimization Pareto optimum |
| title | An efficient descent method for locally Lipschitz multiobjective optimization problems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T19%3A15%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20efficient%20descent%20method%20for%20locally%20Lipschitz%20multiobjective%20optimization%20problems&rft.jtitle=arXiv.org&rft.au=Gebken,%20Bennet&rft.date=2020-04-24&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2004.11578&rft_dat=%3Cproquest_arxiv%3E2395073637%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2395073637&rft_id=info:pmid/&rfr_iscdi=true |