On the convergence of global methods in multiextremal optimization
Identifieur interne : 003243 ( Main/Curation ); précédent : 003242; suivant : 003244On the convergence of global methods in multiextremal optimization
Auteurs : R. Horst [Allemagne] ; H. Tuy [Viêt Nam]Source :
- Journal of Optimization Theory and Applications [ 0022-3239 ] ; 1987-08-01.
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
Abstract: A general class of derivative-free optimization procedures is presented including the corresponding convergence theory. This theory turns out to be very constructive, in the sense that the convergence conditions not only can be verified easily for many existing algorithms, but also allow one to construct new procedures. It is shown that popular methods such as branch-and-bound concepts, Pintér's general class of procedures, the algorithms of Pijavskii, Shubert, and Mladineo, and the approach of Zheng and Galperin can not only be subsumed under this class of methods, but also partly be improved by regarding them within the framework presented.
Url:
DOI: 10.1007/BF00939434
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001200
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :001088
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :001696
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :003882
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001890
- to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :001156
- to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :001679
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :003906
Links to Exploration step
ISTEX:B759147BD55CE37A8617326DE667278AADA749A8Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On the convergence of global methods in multiextremal optimization</title><author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name></author><author><name sortKey="Tuy, H" sort="Tuy, H" uniqKey="Tuy H" first="H." last="Tuy">H. Tuy</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B759147BD55CE37A8617326DE667278AADA749A8</idno><date when="1987" year="1987">1987</date><idno type="doi">10.1007/BF00939434</idno><idno type="url">https://api.istex.fr/document/B759147BD55CE37A8617326DE667278AADA749A8/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001200</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001200</idno><idno type="wicri:Area/Istex/Curation">001088</idno><idno type="wicri:Area/Istex/Checkpoint">001696</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001696</idno><idno type="wicri:doubleKey">0022-3239:1987:Horst R:on:the:convergence</idno><idno type="wicri:Area/Main/Merge">003882</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:88-0228401</idno><idno type="wicri:Area/PascalFrancis/Corpus">001890</idno><idno type="wicri:Area/PascalFrancis/Curation">001156</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">001679</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001679</idno><idno type="wicri:doubleKey">0022-3239:1987:Horst R:on:the:convergence</idno><idno type="wicri:Area/Main/Merge">003906</idno><idno type="wicri:Area/Main/Curation">003243</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On the convergence of global methods in multiextremal optimization</title><author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV-Mathematik, Universität Trier, Trier</wicri:regionArea><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation></author><author><name sortKey="Tuy, H" sort="Tuy, H" uniqKey="Tuy H" first="H." last="Tuy">H. Tuy</name><affiliation wicri:level="1"><country xml:lang="fr">Viêt Nam</country><wicri:regionArea>Institute of Mathematics, Bo Hô, Hanoi</wicri:regionArea><wicri:noRegion>Hanoi</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Optimization Theory and Applications</title><title level="j" type="abbrev">J Optim Theory Appl</title><idno type="ISSN">0022-3239</idno><idno type="eISSN">1573-2878</idno><imprint><publisher>Kluwer Academic Publishers-Plenum Publishers</publisher><pubPlace>New York</pubPlace><date type="published" when="1987-08-01">1987-08-01</date><biblScope unit="volume">54</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="253">253</biblScope><biblScope unit="page" to="271">271</biblScope></imprint><idno type="ISSN">0022-3239</idno></series><idno type="istex">B759147BD55CE37A8617326DE667278AADA749A8</idno><idno type="DOI">10.1007/BF00939434</idno><idno type="ArticleID">BF00939434</idno><idno type="ArticleID">Art3</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0022-3239</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Branch and bound method</term><term>Mathematical programming</term><term>Non linear programming</term><term>Optimization</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Méthode branch and bound</term><term>Optimisation</term><term>Programmation mathématique</term><term>Programmation non linéaire</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A general class of derivative-free optimization procedures is presented including the corresponding convergence theory. This theory turns out to be very constructive, in the sense that the convergence conditions not only can be verified easily for many existing algorithms, but also allow one to construct new procedures. It is shown that popular methods such as branch-and-bound concepts, Pintér's general class of procedures, the algorithms of Pijavskii, Shubert, and Mladineo, and the approach of Zheng and Galperin can not only be subsumed under this class of methods, but also partly be improved by regarding them within the framework presented.</div></front></TEI><double idat="0022-3239:1987:Horst R:on:the:convergence"><INIST><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">On the convergence of global methods in multiextremal optimization</title><author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name></author><author><name sortKey="Tuy, H" sort="Tuy, H" uniqKey="Tuy H" first="H." last="Tuy">H. Tuy</name></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">88-0228401</idno><date when="1987">1987</date><idno type="stanalyst">PASCAL 88-0228401 INIST</idno><idno type="RBID">Pascal:88-0228401</idno><idno type="wicri:Area/PascalFrancis/Corpus">001890</idno><idno type="wicri:Area/PascalFrancis/Curation">001156</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">001679</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001679</idno><idno type="wicri:doubleKey">0022-3239:1987:Horst R:on:the:convergence</idno><idno type="wicri:Area/Main/Merge">003906</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">On the convergence of global methods in multiextremal optimization</title><author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name></author><author><name sortKey="Tuy, H" sort="Tuy, H" uniqKey="Tuy H" first="H." last="Tuy">H. Tuy</name></author></analytic><series><title level="j" type="main">Journal of Optimization Theory and Applications</title><title level="j" type="abbreviated">J. Optim. Theory Appl.</title><idno type="ISSN">0022-3239</idno><imprint><date when="1987">1987</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Journal of Optimization Theory and Applications</title><title level="j" type="abbreviated">J. Optim. Theory Appl.</title><idno type="ISSN">0022-3239</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Branch and bound method</term><term>Mathematical programming</term><term>Non linear programming</term><term>Optimization</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Programmation mathématique</term><term>Programmation non linéaire</term><term>Méthode branch and bound</term><term>Optimisation</term></keywords></textClass></profileDesc></teiHeader></TEI></INIST><ISTEX><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On the convergence of global methods in multiextremal optimization</title><author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name></author><author><name sortKey="Tuy, H" sort="Tuy, H" uniqKey="Tuy H" first="H." last="Tuy">H. Tuy</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B759147BD55CE37A8617326DE667278AADA749A8</idno><date when="1987" year="1987">1987</date><idno type="doi">10.1007/BF00939434</idno><idno type="url">https://api.istex.fr/document/B759147BD55CE37A8617326DE667278AADA749A8/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001200</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001200</idno><idno type="wicri:Area/Istex/Curation">001088</idno><idno type="wicri:Area/Istex/Checkpoint">001696</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001696</idno><idno type="wicri:doubleKey">0022-3239:1987:Horst R:on:the:convergence</idno><idno type="wicri:Area/Main/Merge">003882</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On the convergence of global methods in multiextremal optimization</title><author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV-Mathematik, Universität Trier, Trier</wicri:regionArea><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation></author><author><name sortKey="Tuy, H" sort="Tuy, H" uniqKey="Tuy H" first="H." last="Tuy">H. Tuy</name><affiliation wicri:level="1"><country xml:lang="fr">Viêt Nam</country><wicri:regionArea>Institute of Mathematics, Bo Hô, Hanoi</wicri:regionArea><wicri:noRegion>Hanoi</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Optimization Theory and Applications</title><title level="j" type="abbrev">J Optim Theory Appl</title><idno type="ISSN">0022-3239</idno><idno type="eISSN">1573-2878</idno><imprint><publisher>Kluwer Academic Publishers-Plenum Publishers</publisher><pubPlace>New York</pubPlace><date type="published" when="1987-08-01">1987-08-01</date><biblScope unit="volume">54</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="253">253</biblScope><biblScope unit="page" to="271">271</biblScope></imprint><idno type="ISSN">0022-3239</idno></series><idno type="istex">B759147BD55CE37A8617326DE667278AADA749A8</idno><idno type="DOI">10.1007/BF00939434</idno><idno type="ArticleID">BF00939434</idno><idno type="ArticleID">Art3</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0022-3239</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 class of derivative-free optimization procedures is presented including the corresponding convergence theory. This theory turns out to be very constructive, in the sense that the convergence conditions not only can be verified easily for many existing algorithms, but also allow one to construct new procedures. It is shown that popular methods such as branch-and-bound concepts, Pintér's general class of procedures, the algorithms of Pijavskii, Shubert, and Mladineo, and the approach of Zheng and Galperin can not only be subsumed under this class of methods, but also partly be improved by regarding them within the framework presented.</div></front></TEI></ISTEX></double></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003243 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 003243 | 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= Curation
|type= RBID
|clé= ISTEX:B759147BD55CE37A8617326DE667278AADA749A8
|texte= On the convergence of global methods in multiextremal optimization
}}
| This area was generated with Dilib version V0.6.31. |  |