Subdivision of simplices relative to a cutting plane and finite concave minimization
Identifieur interne : 001027 ( Istex/Checkpoint ); précédent : 001026; suivant : 001028Subdivision of simplices relative to a cutting plane and finite concave minimization
Auteurs : Michael Nast [Allemagne]Source :
- Journal of Global Optimization [ 0925-5001 ] ; 1996-07-01.
Abstract
Abstract: In this article, our primary concern is the classical problem of minimizing globally a concave function over a compact polyhedron (Problem (P)). We present a new simplicial branch and bound approach, which combines triangulations of intersections of simplices with halfspaces and ideas from outer approximation in such a way, that a class of finite algorithms for solving (P) results. For arbitrary compact convex feasible sets one obtains a not necessarily finite but convergent algorithm. Theoretical investigations include determination of the number of simplices in each applied triangulation step and bounds on the number of iterations in the resulting algorithms. Preliminary numerical results are given, and additional applications are sketched.
Url:
DOI: 10.1007/BF00121751
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:4B7FAA946995A4719759448D4670A6F79C2412EDLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Subdivision of simplices relative to a cutting plane and finite concave minimization</title><author><name sortKey="Nast, Michael" sort="Nast, Michael" uniqKey="Nast M" first="Michael" last="Nast">Michael Nast</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:4B7FAA946995A4719759448D4670A6F79C2412ED</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/BF00121751</idno><idno type="url">https://api.istex.fr/document/4B7FAA946995A4719759448D4670A6F79C2412ED/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001254</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001254</idno><idno type="wicri:Area/Istex/Curation">001142</idno><idno type="wicri:Area/Istex/Checkpoint">001027</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001027</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Subdivision of simplices relative to a cutting plane and finite concave minimization</title><author><name sortKey="Nast, Michael" sort="Nast, Michael" uniqKey="Nast M" first="Michael" last="Nast">Michael Nast</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Department of Mathematics, University of Trier, Trier</wicri:regionArea><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Global Optimization</title><title level="j" type="sub">An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management, and Engineer</title><title level="j" type="abbrev">J Glob Optim</title><idno type="ISSN">0925-5001</idno><idno type="eISSN">1573-2916</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="1996-07-01">1996-07-01</date><biblScope unit="volume">9</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="65">65</biblScope><biblScope unit="page" to="93">93</biblScope></imprint><idno type="ISSN">0925-5001</idno></series><idno type="istex">4B7FAA946995A4719759448D4670A6F79C2412ED</idno><idno type="DOI">10.1007/BF00121751</idno><idno type="ArticleID">BF00121751</idno><idno type="ArticleID">Art4</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0925-5001</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this article, our primary concern is the classical problem of minimizing globally a concave function over a compact polyhedron (Problem (P)). We present a new simplicial branch and bound approach, which combines triangulations of intersections of simplices with halfspaces and ideas from outer approximation in such a way, that a class of finite algorithms for solving (P) results. For arbitrary compact convex feasible sets one obtains a not necessarily finite but convergent algorithm. Theoretical investigations include determination of the number of simplices in each applied triangulation step and bounds on the number of iterations in the resulting algorithms. Preliminary numerical results are given, and additional applications are sketched.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Nast, Michael" sort="Nast, Michael" uniqKey="Nast M" first="Michael" last="Nast">Michael Nast</name></region><name sortKey="Nast, Michael" sort="Nast, Michael" uniqKey="Nast M" first="Michael" last="Nast">Michael Nast</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001027 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 001027 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Checkpoint
|type= RBID
|clé= ISTEX:4B7FAA946995A4719759448D4670A6F79C2412ED
|texte= Subdivision of simplices relative to a cutting plane and finite concave minimization
}}
| This area was generated with Dilib version V0.6.31. |  |