A modified probability collectives optimization algorithm based on trust region method and a new temperature annealing schedule
This article presents a distributed random search optimization method, the trust region probability collectives (TRPC) method, for unconstrained optimization problems without closed forms. Through analyzing the framework of the original probability collectives (PC) algorithm, three potential require...
Gespeichert in:
| Veröffentlicht in: | Soft computing (Berlin, Germany) Germany), 2016-04, Vol.20 (4), p.1581-1600 |
|---|---|
| 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 | 1600 |
|---|---|
| container_issue | 4 |
| container_start_page | 1581 |
| container_title | Soft computing (Berlin, Germany) |
| container_volume | 20 |
| creator | Yang, Bo Wu, Ruiming |
| description | This article presents a distributed random search optimization method, the trust region probability collectives (TRPC) method, for unconstrained optimization problems without closed forms. Through analyzing the framework of the original probability collectives (PC) algorithm, three potential requirements on solving the original PC model are first identified. Then an interior point trust region method for bound constrained minimization is adopted to satisfy these requirements. Besides, the temperature annealing schedule is also redesigned to improve the algorithmic performance. Since the new annealing schedule is linked to the gradient, it is much more flexible and efficient than the original one. Ten benchmark functions are used to test the modified algorithm. Numerical results show that TRPC is superior to the PC algorithm in iteration times, accuracy, and robustness. |
| doi_str_mv | 10.1007/s00500-015-1607-7 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2918109457</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2918109457</sourcerecordid><originalsourceid>FETCH-LOGICAL-c386t-466b440059184697fa9325a580e0db07b621791c8716eb3b197eae40f9acbb163</originalsourceid><addsrcrecordid>eNp1UE1LxDAQLaLguvoDvAU8VydtmrTHZfELBC96Dkk77WZpm5qkynrxr5t1BU8ehhlm3nvDe0lySeGaAogbD1AApECLlHIQqThKFpTleSqYqI5_5iwVnOWnyZn3W4CMiiJfJF8rMtjGtAYbMjmrlTa9CTtS277HOph39MROwQzmUwVjR6L6zjoTNgPRykdSXAU3-0Acdvv7gGFjG6LGWGTEDxJwmNCpMDuM2xFVb8aO-HqDzdzjeXLSqt7jxW9fJq93ty_rh_Tp-f5xvXpK67zkIWWca8aix4qWjFeiVVWeFaooAaHRIDSPfipal4Jy1LmmlUCFDNpK1VpTni-Tq4NuNPk2ow9ya2c3xpcyi5oUKlaIiKIHVO2s9w5bOTkzKLeTFOQ-Z3nIWcac5T5nuedkB46P2LFD96f8P-kbwliCBg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918109457</pqid></control><display><type>article</type><title>A modified probability collectives optimization algorithm based on trust region method and a new temperature annealing schedule</title><source>ProQuest Central UK/Ireland</source><source>SpringerLink Journals - AutoHoldings</source><source>ProQuest Central</source><creator>Yang, Bo ; Wu, Ruiming</creator><creatorcontrib>Yang, Bo ; Wu, Ruiming</creatorcontrib><description>This article presents a distributed random search optimization method, the trust region probability collectives (TRPC) method, for unconstrained optimization problems without closed forms. Through analyzing the framework of the original probability collectives (PC) algorithm, three potential requirements on solving the original PC model are first identified. Then an interior point trust region method for bound constrained minimization is adopted to satisfy these requirements. Besides, the temperature annealing schedule is also redesigned to improve the algorithmic performance. Since the new annealing schedule is linked to the gradient, it is much more flexible and efficient than the original one. Ten benchmark functions are used to test the modified algorithm. Numerical results show that TRPC is superior to the PC algorithm in iteration times, accuracy, and robustness.</description><identifier>ISSN: 1432-7643</identifier><identifier>EISSN: 1433-7479</identifier><identifier>DOI: 10.1007/s00500-015-1607-7</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithms ; Annealing ; Artificial Intelligence ; Computational Intelligence ; Control ; Engineering ; Equilibrium ; Game theory ; Iterative methods ; Mathematical Logic and Foundations ; Mechatronics ; Methodologies and Application ; Methods ; Optimization ; Probability distribution ; Robotics ; Robustness (mathematics) ; Schedules ; Trustworthiness ; Variables</subject><ispartof>Soft computing (Berlin, Germany), 2016-04, Vol.20 (4), p.1581-1600</ispartof><rights>Springer-Verlag Berlin Heidelberg 2015</rights><rights>Springer-Verlag Berlin Heidelberg 2015.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c386t-466b440059184697fa9325a580e0db07b621791c8716eb3b197eae40f9acbb163</citedby><cites>FETCH-LOGICAL-c386t-466b440059184697fa9325a580e0db07b621791c8716eb3b197eae40f9acbb163</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00500-015-1607-7$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918109457?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,21388,27924,27925,33744,41488,42557,43805,51319,64385,64389,72469</link.rule.ids></links><search><creatorcontrib>Yang, Bo</creatorcontrib><creatorcontrib>Wu, Ruiming</creatorcontrib><title>A modified probability collectives optimization algorithm based on trust region method and a new temperature annealing schedule</title><title>Soft computing (Berlin, Germany)</title><addtitle>Soft Comput</addtitle><description>This article presents a distributed random search optimization method, the trust region probability collectives (TRPC) method, for unconstrained optimization problems without closed forms. Through analyzing the framework of the original probability collectives (PC) algorithm, three potential requirements on solving the original PC model are first identified. Then an interior point trust region method for bound constrained minimization is adopted to satisfy these requirements. Besides, the temperature annealing schedule is also redesigned to improve the algorithmic performance. Since the new annealing schedule is linked to the gradient, it is much more flexible and efficient than the original one. Ten benchmark functions are used to test the modified algorithm. Numerical results show that TRPC is superior to the PC algorithm in iteration times, accuracy, and robustness.</description><subject>Algorithms</subject><subject>Annealing</subject><subject>Artificial Intelligence</subject><subject>Computational Intelligence</subject><subject>Control</subject><subject>Engineering</subject><subject>Equilibrium</subject><subject>Game theory</subject><subject>Iterative methods</subject><subject>Mathematical Logic and Foundations</subject><subject>Mechatronics</subject><subject>Methodologies and Application</subject><subject>Methods</subject><subject>Optimization</subject><subject>Probability distribution</subject><subject>Robotics</subject><subject>Robustness (mathematics)</subject><subject>Schedules</subject><subject>Trustworthiness</subject><subject>Variables</subject><issn>1432-7643</issn><issn>1433-7479</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1UE1LxDAQLaLguvoDvAU8VydtmrTHZfELBC96Dkk77WZpm5qkynrxr5t1BU8ehhlm3nvDe0lySeGaAogbD1AApECLlHIQqThKFpTleSqYqI5_5iwVnOWnyZn3W4CMiiJfJF8rMtjGtAYbMjmrlTa9CTtS277HOph39MROwQzmUwVjR6L6zjoTNgPRykdSXAU3-0Acdvv7gGFjG6LGWGTEDxJwmNCpMDuM2xFVb8aO-HqDzdzjeXLSqt7jxW9fJq93ty_rh_Tp-f5xvXpK67zkIWWca8aix4qWjFeiVVWeFaooAaHRIDSPfipal4Jy1LmmlUCFDNpK1VpTni-Tq4NuNPk2ow9ya2c3xpcyi5oUKlaIiKIHVO2s9w5bOTkzKLeTFOQ-Z3nIWcac5T5nuedkB46P2LFD96f8P-kbwliCBg</recordid><startdate>20160401</startdate><enddate>20160401</enddate><creator>Yang, Bo</creator><creator>Wu, Ruiming</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope></search><sort><creationdate>20160401</creationdate><title>A modified probability collectives optimization algorithm based on trust region method and a new temperature annealing schedule</title><author>Yang, Bo ; Wu, Ruiming</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c386t-466b440059184697fa9325a580e0db07b621791c8716eb3b197eae40f9acbb163</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Annealing</topic><topic>Artificial Intelligence</topic><topic>Computational Intelligence</topic><topic>Control</topic><topic>Engineering</topic><topic>Equilibrium</topic><topic>Game theory</topic><topic>Iterative methods</topic><topic>Mathematical Logic and Foundations</topic><topic>Mechatronics</topic><topic>Methodologies and Application</topic><topic>Methods</topic><topic>Optimization</topic><topic>Probability distribution</topic><topic>Robotics</topic><topic>Robustness (mathematics)</topic><topic>Schedules</topic><topic>Trustworthiness</topic><topic>Variables</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yang, Bo</creatorcontrib><creatorcontrib>Wu, Ruiming</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</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>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><jtitle>Soft computing (Berlin, Germany)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yang, Bo</au><au>Wu, Ruiming</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A modified probability collectives optimization algorithm based on trust region method and a new temperature annealing schedule</atitle><jtitle>Soft computing (Berlin, Germany)</jtitle><stitle>Soft Comput</stitle><date>2016-04-01</date><risdate>2016</risdate><volume>20</volume><issue>4</issue><spage>1581</spage><epage>1600</epage><pages>1581-1600</pages><issn>1432-7643</issn><eissn>1433-7479</eissn><abstract>This article presents a distributed random search optimization method, the trust region probability collectives (TRPC) method, for unconstrained optimization problems without closed forms. Through analyzing the framework of the original probability collectives (PC) algorithm, three potential requirements on solving the original PC model are first identified. Then an interior point trust region method for bound constrained minimization is adopted to satisfy these requirements. Besides, the temperature annealing schedule is also redesigned to improve the algorithmic performance. Since the new annealing schedule is linked to the gradient, it is much more flexible and efficient than the original one. Ten benchmark functions are used to test the modified algorithm. Numerical results show that TRPC is superior to the PC algorithm in iteration times, accuracy, and robustness.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s00500-015-1607-7</doi><tpages>20</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1432-7643 |
| ispartof | Soft computing (Berlin, Germany), 2016-04, Vol.20 (4), p.1581-1600 |
| issn | 1432-7643 1433-7479 |
| language | eng |
| recordid | cdi_proquest_journals_2918109457 |
| source | ProQuest Central UK/Ireland; SpringerLink Journals - AutoHoldings; ProQuest Central |
| subjects | Algorithms Annealing Artificial Intelligence Computational Intelligence Control Engineering Equilibrium Game theory Iterative methods Mathematical Logic and Foundations Mechatronics Methodologies and Application Methods Optimization Probability distribution Robotics Robustness (mathematics) Schedules Trustworthiness Variables |
| title | A modified probability collectives optimization algorithm based on trust region method and a new temperature annealing schedule |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T19%3A25%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20modified%20probability%20collectives%20optimization%20algorithm%20based%20on%20trust%20region%20method%20and%20a%20new%20temperature%20annealing%20schedule&rft.jtitle=Soft%20computing%20(Berlin,%20Germany)&rft.au=Yang,%20Bo&rft.date=2016-04-01&rft.volume=20&rft.issue=4&rft.spage=1581&rft.epage=1600&rft.pages=1581-1600&rft.issn=1432-7643&rft.eissn=1433-7479&rft_id=info:doi/10.1007/s00500-015-1607-7&rft_dat=%3Cproquest_cross%3E2918109457%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918109457&rft_id=info:pmid/&rfr_iscdi=true |