Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems
Identifieur interne : 003159 ( Main/Exploration ); précédent : 003158; suivant : 003160Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems
Auteurs : Hoang Tuy [Viêt Nam] ; Reiner Horst [Allemagne]Source :
- Mathematical Programming [ 0025-5610 ] ; 1988-05-01.
Abstract
Abstract: A general branch-and-bound conceptual scheme for global optimization is presented that includes along with previous branch-and-bound approaches also grid-search techniques. The corresponding convergence theory, as well as the question of restart capability for branch-and-bound algorithms used in decomposition or outer approximation schemes are discussed. As an illustration of this conceptual scheme, a finite branch-and-bound algorithm for concave minimization is described and a convergent branch-and-bound algorithm, based on the previous one, is developed for the minimization of a difference of two convex functions.
Url:
DOI: 10.1007/BF01580762
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001118
- to stream Istex, to step Curation: 001007
- to stream Istex, to step Checkpoint: 001654
- to stream Main, to step Merge: 003790
- to stream Main, to step Curation: 003159
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems</title><author><name sortKey="Tuy, Hoang" sort="Tuy, Hoang" uniqKey="Tuy H" first="Hoang" last="Tuy">Hoang Tuy</name></author><author><name sortKey="Horst, Reiner" sort="Horst, Reiner" uniqKey="Horst R" first="Reiner" last="Horst">Reiner Horst</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C731794D402FA8E04BD7E6EA71AAFF865C54118A</idno><date when="1988" year="1988">1988</date><idno type="doi">10.1007/BF01580762</idno><idno type="url">https://api.istex.fr/document/C731794D402FA8E04BD7E6EA71AAFF865C54118A/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001118</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001118</idno><idno type="wicri:Area/Istex/Curation">001007</idno><idno type="wicri:Area/Istex/Checkpoint">001654</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001654</idno><idno type="wicri:doubleKey">0025-5610:1988:Tuy H:convergence:and:restart</idno><idno type="wicri:Area/Main/Merge">003790</idno><idno type="wicri:Area/Main/Curation">003159</idno><idno type="wicri:Area/Main/Exploration">003159</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems</title><author><name sortKey="Tuy, Hoang" sort="Tuy, Hoang" uniqKey="Tuy H" first="Hoang" last="Tuy">Hoang Tuy</name><affiliation wicri:level="1"><country xml:lang="fr">Viêt Nam</country><wicri:regionArea>Institute of Mathematics, Hanoi</wicri:regionArea><wicri:noRegion>Hanoi</wicri:noRegion></affiliation></author><author><name sortKey="Horst, Reiner" sort="Horst, Reiner" uniqKey="Horst R" first="Reiner" last="Horst">Reiner Horst</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Universität Trier, Trier</wicri:regionArea><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Mathematical Programming</title><title level="j" type="abbrev">Mathematical Programming</title><idno type="ISSN">0025-5610</idno><idno type="eISSN">1436-4646</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><date type="published" when="1988-05-01">1988-05-01</date><biblScope unit="volume">41</biblScope><biblScope unit="issue">1-3</biblScope><biblScope unit="page" from="161">161</biblScope><biblScope unit="page" to="183">183</biblScope></imprint><idno type="ISSN">0025-5610</idno></series><idno type="istex">C731794D402FA8E04BD7E6EA71AAFF865C54118A</idno><idno type="DOI">10.1007/BF01580762</idno><idno type="ArticleID">BF01580762</idno><idno type="ArticleID">Art12</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0025-5610</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A general branch-and-bound conceptual scheme for global optimization is presented that includes along with previous branch-and-bound approaches also grid-search techniques. The corresponding convergence theory, as well as the question of restart capability for branch-and-bound algorithms used in decomposition or outer approximation schemes are discussed. As an illustration of this conceptual scheme, a finite branch-and-bound algorithm for concave minimization is described and a convergent branch-and-bound algorithm, based on the previous one, is developed for the minimization of a difference of two convex functions.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Viêt Nam</li></country></list><tree><country name="Viêt Nam"><noRegion><name sortKey="Tuy, Hoang" sort="Tuy, Hoang" uniqKey="Tuy H" first="Hoang" last="Tuy">Hoang Tuy</name></noRegion></country><country name="Allemagne"><noRegion><name sortKey="Horst, Reiner" sort="Horst, Reiner" uniqKey="Horst R" first="Reiner" last="Horst">Reiner Horst</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003159 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003159 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:C731794D402FA8E04BD7E6EA71AAFF865C54118A
|texte= Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems
}}
| This area was generated with Dilib version V0.6.31. |  |