A modified simplicial algorithm for convex maximization based on an extension of [Formula omitted]-subdivision

The simplicial algorithm is a popular branch-and-bound approach to the convex maximization problem with multiple local maxima. In this paper, we discuss some difficulties revealed when implementing this algorithm under the [Formula omitted]-subdivision rule. To overcome those, we modify the bounding...

Full description

Saved in:
Bibliographic Details
Published in:Journal of global optimization 2018-06, Vol.71 (2), p.297
Main Author: Kuno, Takahito
Format: Article
Language:English
Subjects:
Algorithms
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue 2
container_start_page 297
container_title Journal of global optimization
container_volume 71
creator Kuno, Takahito
description The simplicial algorithm is a popular branch-and-bound approach to the convex maximization problem with multiple local maxima. In this paper, we discuss some difficulties revealed when implementing this algorithm under the [Formula omitted]-subdivision rule. To overcome those, we modify the bounding process and extend the [Formula omitted]-subdivision rule. We also report numerical results for the simplicial algorithm according to the new subdivision rule.
doi_str_mv 10.1007/s10898-018-0619-0
format article
fullrecord <record><control><sourceid>gale</sourceid><recordid>TN_cdi_gale_infotracacademiconefile_A718421932</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A718421932</galeid><sourcerecordid>A718421932</sourcerecordid><originalsourceid>FETCH-gale_infotracacademiconefile_A7184219323</originalsourceid><addsrcrecordid>eNqVTVtKA0EQnA8F4-MA_vUFJvZsXLPzGcTgAfyTIJ2dntgyD9mZhMXTOwEvIEVRRVFFKXVvcGkQ1w_F4GAHjabxyViNF2qBtut1j2iu1HUpX4hoh75bqLSBmJ14YQdF4neQUSgAhUOepH5G8HmCMacTzxBplig_VCUn2FNpk2YoAc-VUzmn2cP7Nk_xGAhylFrZ7XQ57p2c5Fy4VZeeQuG7P71Ry-3L2_OrPlDgD0k-14nGBsdR2i17aflmbYbHzthVt_r34BeOjFfm</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A modified simplicial algorithm for convex maximization based on an extension of [Formula omitted]-subdivision</title><source>ABI/INFORM Global</source><source>Springer Link</source><creator>Kuno, Takahito</creator><creatorcontrib>Kuno, Takahito</creatorcontrib><description>The simplicial algorithm is a popular branch-and-bound approach to the convex maximization problem with multiple local maxima. In this paper, we discuss some difficulties revealed when implementing this algorithm under the [Formula omitted]-subdivision rule. To overcome those, we modify the bounding process and extend the [Formula omitted]-subdivision rule. We also report numerical results for the simplicial algorithm according to the new subdivision rule.</description><identifier>ISSN: 0925-5001</identifier><identifier>DOI: 10.1007/s10898-018-0619-0</identifier><language>eng</language><publisher>Springer</publisher><subject>Algorithms</subject><ispartof>Journal of global optimization, 2018-06, Vol.71 (2), p.297</ispartof><rights>COPYRIGHT 2018 Springer</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Kuno, Takahito</creatorcontrib><title>A modified simplicial algorithm for convex maximization based on an extension of [Formula omitted]-subdivision</title><title>Journal of global optimization</title><description>The simplicial algorithm is a popular branch-and-bound approach to the convex maximization problem with multiple local maxima. In this paper, we discuss some difficulties revealed when implementing this algorithm under the [Formula omitted]-subdivision rule. To overcome those, we modify the bounding process and extend the [Formula omitted]-subdivision rule. We also report numerical results for the simplicial algorithm according to the new subdivision rule.</description><subject>Algorithms</subject><issn>0925-5001</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid/><recordid>eNqVTVtKA0EQnA8F4-MA_vUFJvZsXLPzGcTgAfyTIJ2dntgyD9mZhMXTOwEvIEVRRVFFKXVvcGkQ1w_F4GAHjabxyViNF2qBtut1j2iu1HUpX4hoh75bqLSBmJ14YQdF4neQUSgAhUOepH5G8HmCMacTzxBplig_VCUn2FNpk2YoAc-VUzmn2cP7Nk_xGAhylFrZ7XQ57p2c5Fy4VZeeQuG7P71Ry-3L2_OrPlDgD0k-14nGBsdR2i17aflmbYbHzthVt_r34BeOjFfm</recordid><startdate>20180601</startdate><enddate>20180601</enddate><creator>Kuno, Takahito</creator><general>Springer</general><scope/></search><sort><creationdate>20180601</creationdate><title>A modified simplicial algorithm for convex maximization based on an extension of [Formula omitted]-subdivision</title><author>Kuno, Takahito</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-gale_infotracacademiconefile_A7184219323</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kuno, Takahito</creatorcontrib><jtitle>Journal of global optimization</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kuno, Takahito</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A modified simplicial algorithm for convex maximization based on an extension of [Formula omitted]-subdivision</atitle><jtitle>Journal of global optimization</jtitle><date>2018-06-01</date><risdate>2018</risdate><volume>71</volume><issue>2</issue><spage>297</spage><pages>297-</pages><issn>0925-5001</issn><abstract>The simplicial algorithm is a popular branch-and-bound approach to the convex maximization problem with multiple local maxima. In this paper, we discuss some difficulties revealed when implementing this algorithm under the [Formula omitted]-subdivision rule. To overcome those, we modify the bounding process and extend the [Formula omitted]-subdivision rule. We also report numerical results for the simplicial algorithm according to the new subdivision rule.</abstract><pub>Springer</pub><doi>10.1007/s10898-018-0619-0</doi></addata></record>
fulltext fulltext
identifier ISSN: 0925-5001
ispartof Journal of global optimization, 2018-06, Vol.71 (2), p.297
issn 0925-5001
language eng
recordid cdi_gale_infotracacademiconefile_A718421932
source ABI/INFORM Global; Springer Link
subjects Algorithms
title A modified simplicial algorithm for convex maximization based on an extension of [Formula omitted]-subdivision
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T10%3A48%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20modified%20simplicial%20algorithm%20for%20convex%20maximization%20based%20on%20an%20extension%20of%20%5BFormula%20omitted%5D-subdivision&rft.jtitle=Journal%20of%20global%20optimization&rft.au=Kuno,%20Takahito&rft.date=2018-06-01&rft.volume=71&rft.issue=2&rft.spage=297&rft.pages=297-&rft.issn=0925-5001&rft_id=info:doi/10.1007/s10898-018-0619-0&rft_dat=%3Cgale%3EA718421932%3C/gale%3E%3Cgrp_id%3Ecdi_FETCH-gale_infotracacademiconefile_A7184219323%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_galeid=A718421932&rfr_iscdi=true