A new simplicial cover technique in constrained global optimization
Identifieur interne : 001056 ( Istex/Corpus ); précédent : 001055; suivant : 001057A new simplicial cover technique in constrained global optimization
Auteurs : R. Horst ; N. V. Thoai ; J. De VriesSource :
- Journal of Global Optimization [ 0925-5001 ] ; 1992-03-01.
Abstract
Abstract: A simplicial branch and bound-outer approximation technique for solving nonseparable, nonlinearly constrained concave minimization problems is proposed which uses a new simplicial cover rather than classical simplicial partitions. Some geometric properties and convergence results are demonstrated. A report on numerical aspects and experiments is given which shows that the most promising variant of the cover technique can be expected to be more efficient than comparable previous simplicial procedures.
Url:
DOI: 10.1007/BF00121299
Links to Exploration step
ISTEX:5A59540EB3BBA7A7CE360FE6E0C84445B6444678Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A new simplicial cover technique in constrained global optimization</title><author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name><affiliation><mods:affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</mods:affiliation></affiliation></author><author><name sortKey="Thoai, N V" sort="Thoai, N V" uniqKey="Thoai N" first="N. V." last="Thoai">N. V. Thoai</name><affiliation><mods:affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</mods:affiliation></affiliation></author><author><name sortKey="De Vries, J" sort="De Vries, J" uniqKey="De Vries J" first="J." last="De Vries">J. De Vries</name><affiliation><mods:affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:5A59540EB3BBA7A7CE360FE6E0C84445B6444678</idno><date when="1992" year="1992">1992</date><idno type="doi">10.1007/BF00121299</idno><idno type="url">https://api.istex.fr/document/5A59540EB3BBA7A7CE360FE6E0C84445B6444678/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001056</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001056</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A new simplicial cover technique in constrained global optimization</title><author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name><affiliation><mods:affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</mods:affiliation></affiliation></author><author><name sortKey="Thoai, N V" sort="Thoai, N V" uniqKey="Thoai N" first="N. V." last="Thoai">N. V. Thoai</name><affiliation><mods:affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</mods:affiliation></affiliation></author><author><name sortKey="De Vries, J" sort="De Vries, J" uniqKey="De Vries J" first="J." last="De Vries">J. De Vries</name><affiliation><mods:affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</mods:affiliation></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="1992-03-01">1992-03-01</date><biblScope unit="volume">2</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="1">1</biblScope><biblScope unit="page" to="19">19</biblScope></imprint><idno type="ISSN">0925-5001</idno></series><idno type="istex">5A59540EB3BBA7A7CE360FE6E0C84445B6444678</idno><idno type="DOI">10.1007/BF00121299</idno><idno type="ArticleID">BF00121299</idno><idno type="ArticleID">Art2</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: A simplicial branch and bound-outer approximation technique for solving nonseparable, nonlinearly constrained concave minimization problems is proposed which uses a new simplicial cover rather than classical simplicial partitions. Some geometric properties and convergence results are demonstrated. A report on numerical aspects and experiments is given which shows that the most promising variant of the cover technique can be expected to be more efficient than comparable previous simplicial procedures.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>R. Horst</name><affiliations><json:string>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</json:string></affiliations></json:item><json:item><name>N. V. Thoai</name><affiliations><json:string>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</json:string></affiliations></json:item><json:item><name>J. De Vries</name><affiliations><json:string>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</json:string></affiliations></json:item></author><articleId><json:string>BF00121299</json:string><json:string>Art2</json:string></articleId><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: A simplicial branch and bound-outer approximation technique for solving nonseparable, nonlinearly constrained concave minimization problems is proposed which uses a new simplicial cover rather than classical simplicial partitions. Some geometric properties and convergence results are demonstrated. A report on numerical aspects and experiments is given which shows that the most promising variant of the cover technique can be expected to be more efficient than comparable previous simplicial procedures.</abstract><qualityIndicators><score>5.828</score><pdfVersion>1.3</pdfVersion><pdfPageSize>453 x 677 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>515</abstractCharCount><pdfWordCount>6673</pdfWordCount><pdfCharCount>35805</pdfCharCount><pdfPageCount>19</pdfPageCount><abstractWordCount>69</abstractWordCount></qualityIndicators><title>A new simplicial cover technique in constrained global optimization</title><refBibs><json:item><host><author><json:item><name>R Horst</name></json:item><json:item><name> Horst</name></json:item><json:item><name>Benson,R Thoai</name></json:item><json:item><name> Horst</name></json:item></author><title>Table I. Subproblem y-extension Procedure line-search Reference Horst and Thoai</title><publicationDate>1989</publicationDate></host></json:item><json:item><author><json:item><name>F,A Al-Khayyal</name></json:item><json:item><name>J,E Falk</name></json:item></author><host><pages><last>286</last><first>273</first></pages><author></author><title>Jointly Constrained Biconvex Programming</title><publicationDate>1983</publicationDate></host><publicationDate>1983</publicationDate></json:item><json:item><host><pages><last>394</last><first>389</first></pages><author><json:item><name>H,P Benson</name></json:item></author><title>Separable Concave Minimization via Partial Outer Approximation and Branch and Bound</title><publicationDate>1990</publicationDate></host></json:item><json:item><author><json:item><name>H,P Benson</name></json:item><json:item><name>S Erenguc</name></json:item></author><host><volume>59</volume><pages><last>246</last><first>223</first></pages><author></author><title>Journal of Optimization Theory and Applications</title><publicationDate>1988</publicationDate></host><title>Using Convex Envelopes to Solve the Interactive Fixed Charge Linear Programming Problem</title><publicationDate>1988</publicationDate></json:item><json:item><author><json:item><name>H,P Benson</name></json:item><json:item><name>R Horst</name></json:item></author><host><volume>21</volume><pages><last>76</last><first>67</first></pages><author></author><title>I. Computers and Mathematics with Applications</title><publicationDate>1991</publicationDate></host><title>A Branch and Bound-Outer Approximation Algorithm for Concave Minimization over a Convex Set</title><publicationDate>1991</publicationDate></json:item><json:item><host><author><json:item><name>P,C Chen</name></json:item><json:item><name>P Hansen</name></json:item><json:item><name>B Jaumard</name></json:item></author><title>On-Line and Off-Line Vertex Enumeration by Adjacency Lists</title><publicationDate>1991</publicationDate></host></json:item><json:item><author><json:item><name>B,C Eaves</name></json:item><json:item><name>W,I Zangwill</name></json:item></author><host><pages><last>542</last><first>529</first></pages><author></author><title>Generalized Cutting Plane Algorithms</title><publicationDate>1971</publicationDate></host><publicationDate>1971</publicationDate></json:item><json:item><author><json:item><name>J,E Falk</name></json:item><json:item><name>R,M Soland</name></json:item></author><host><volume>15</volume><pages><last>569</last><first>550</first></pages><author></author><title>Management Science</title><publicationDate>1969</publicationDate></host><title>An Algorithm for Separable Nonconvex Programming Problems</title><publicationDate>1969</publicationDate></json:item><json:item><author><json:item><name>K,L Hoffman</name></json:item></author><host><volume>20</volume><pages><last>32</last><first>22</first></pages><author></author><title>Mathematical Programming</title><publicationDate>1981</publicationDate></host><title>A Method for Globally Minimizing Concave Functions over Convex Sets</title><publicationDate>1981</publicationDate></json:item><json:item><author><json:item><name>R Hors&</name></json:item></author><host><volume>10</volume><pages><last>321</last><first>312</first></pages><author></author><title>Mathematical Programming</title><publicationDate>1976</publicationDate></host><title>An Algorithm for Nonconvex Programming Problems</title><publicationDate>1976</publicationDate></json:item><json:item><author><json:item><name>R Horst</name></json:item></author><host><volume>19</volume><pages><last>238</last><first>237</first></pages><author></author><title>Mathematical Programming</title><publicationDate>1980</publicationDate></host><title>A Note on the Convergence of an Algorithm for Noncovex Programming Problems</title><publicationDate>1980</publicationDate></json:item><json:item><author><json:item><name>R Horst</name></json:item></author><host><volume>51</volume><pages><last>291</last><first>271</first></pages><author></author><title>Journal of Optimization Theory and Applications</title><publicationDate>1986</publicationDate></host><title>A General Class of Branch and Bound Methods in Global Optimization with Some New Approaches for Concave Minimization</title><publicationDate>1986</publicationDate></json:item><json:item><author><json:item><name>R Horst</name></json:item><json:item><name>N,V Thoai</name></json:item></author><host><volume>42</volume><pages><last>289</last><first>271</first></pages><author></author><title>Computing</title><publicationDate>1989</publicationDate></host><title>Modification, Implementation and Comparison of Three Algorithms for Globally Solving Linearly Constrained Concave Minimization Problems</title><publicationDate>1989</publicationDate></json:item><json:item><host><author><json:item><name>R Horst</name></json:item><json:item><name>N,V Thoai</name></json:item><json:item><name>H,P Benson</name></json:item></author><title>Concave Minimization via Conical Partitions and Polyhedral Outer Approximation</title><publicationDate>1991</publicationDate></host></json:item><json:item><author><json:item><name>R Horst</name></json:item><json:item><name>N,V Thoai</name></json:item><json:item><name>De Vries</name></json:item><json:item><name>J </name></json:item></author><host><volume>7</volume><pages><last>90</last><first>85</first></pages><author></author><title>Operations Research Letters</title><publicationDate>1988</publicationDate></host><title>On Finding New Vertices and Redundant Constraints in Cutting Plane Algorithms for Global Optimization</title><publicationDate>1988</publicationDate></json:item><json:item><host><author><json:item><name>R Horst</name></json:item><json:item><name>N,V Thoai</name></json:item><json:item><name>De Vries</name></json:item><json:item><name>J </name></json:item></author><title>On Geometry and Convergence of Simplicial Covers, submitted for publication</title><publicationDate>1991</publicationDate></host></json:item><json:item><author><json:item><name>R Horst</name></json:item><json:item><name>N,V Thoai</name></json:item><json:item><name>H Tuy</name></json:item></author><host><volume>9</volume><pages><last>159</last><first>153</first></pages><author></author><title>Operations Research Spektrum</title><publicationDate>1987</publicationDate></host><title>Outer Approximation by Polyhedral Convex Sets</title><publicationDate>1987</publicationDate></json:item><json:item><author><json:item><name>R Horst</name></json:item><json:item><name>N,V Thoai</name></json:item><json:item><name>H Tuy</name></json:item></author><host><volume>20</volume><pages><last>264</last><first>255</first></pages><author></author><title>Optimization</title><publicationDate>1989</publicationDate></host><title>On an Outer Approximation Concept in Global Optimization</title><publicationDate>1989</publicationDate></json:item><json:item><author><json:item><name>R Horst</name></json:item><json:item><name>H Tuy</name></json:item></author><host><volume>54</volume><pages><last>271</last><first>253</first></pages><author></author><title>Journal of Optimization Theory and Applications</title><publicationDate>1987</publicationDate></host><title>On the Convergence of Global Methods in Multiextremal Optimization</title><publicationDate>1987</publicationDate></json:item><json:item><author><json:item><name>R Horst</name></json:item><json:item><name>H Tuy</name></json:item></author><host><author></author><title>Global Optimization (Deterministic Approaches)</title><publicationDate>1990</publicationDate></host><publicationDate>1990</publicationDate></json:item><json:item><author><json:item><name>P,M Pardalos</name></json:item><json:item><name>J,B Rosen</name></json:item></author><host><author></author><title>Constrained Global Optimization: Algorithms and Applications</title><publicationDate>1987</publicationDate></host><publicationDate>1987</publicationDate></json:item><json:item><author><json:item><name>T,V Thieu</name></json:item><json:item><name>B,T Tam</name></json:item><json:item><name>T,V Ban</name></json:item></author><host><volume>8</volume><pages><last>40</last><first>21</first></pages><author></author><title>Acta Mathematics Vietnamica</title><publicationDate>1983</publicationDate></host><title>An Outer Approximation Method for Globally Minimizing a Concave Function over a Compact Convex Set</title><publicationDate>1983</publicationDate></json:item><json:item><author><json:item><name>N,V Thoai</name></json:item><json:item><name>De,J Vries</name></json:item></author><host><pages><last>365</last><first>363</first></pages><author></author><title>Proceedings XIII. Symposium on Operations Research</title><publicationDate>1988</publicationDate></host><title>Numerical Experiments on Concave Minimization Problems</title><publicationDate>1988</publicationDate></json:item><json:item><host><pages><last>36</last><first>23</first></pages><author><json:item><name>H Tuy</name></json:item></author><title>Effect of the Subdivision Strategy on Convergence and Efficiency of Some Global Optimization Algorithms, 1. of Global Optimization</title><publicationDate>1991</publicationDate></host></json:item><json:item><author><json:item><name>H Tuy</name></json:item><json:item><name>R Horst</name></json:item></author><host><volume>41</volume><pages><last>183</last><first>161</first></pages><author></author><title>Mathematical Programming</title><publicationDate>1988</publicationDate></host><title>Convergence and Restart in Branch and Bound Algorithms for Global Optimization, Application to Concave Minimization and DC-Optimization Problems</title><publicationDate>1988</publicationDate></json:item><json:item><author><json:item><name>H Tuy</name></json:item><json:item><name>T,V Thieu</name></json:item><json:item><name>N,Q Thai</name></json:item></author><host><volume>10</volume><pages><last>515</last><first>498</first></pages><author></author><title>Mathematics of Operations Research</title><publicationDate>1985</publicationDate></host><title>A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set</title><publicationDate>1985</publicationDate></json:item><json:item><author><json:item><name>A,F Veinott</name></json:item></author><host><volume>14</volume><pages><last>507</last><first>486</first></pages><author></author><title>Operations Research</title><publicationDate>1967</publicationDate></host><title>Minimum Concave Cost Solution of Leontiev Substitution Models of Multi- Facility Inventory Systems</title><publicationDate>1967</publicationDate></json:item></refBibs><genre><json:string>research-article</json:string></genre><host><volume>2</volume><pages><last>19</last><first>1</first></pages><issn><json:string>0925-5001</json:string></issn><issue>1</issue><subject><json:item><value>Computer Science, general</value></json:item><json:item><value>Real Functions</value></json:item><json:item><value>Optimization</value></json:item><json:item><value>Operation Research/Decision Theory</value></json:item></subject><journalId><json:string>10898</json:string></journalId><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1573-2916</json:string></eissn><title>Journal of Global Optimization</title><publicationDate>1992</publicationDate><copyrightDate>1992</copyrightDate></host><categories><wos><json:string>science</json:string><json:string>operations research & management science</json:string><json:string>mathematics, applied</json:string></wos><scienceMetrix><json:string>applied sciences</json:string><json:string>engineering</json:string><json:string>operations research</json:string></scienceMetrix></categories><publicationDate>1992</publicationDate><copyrightDate>1992</copyrightDate><doi><json:string>10.1007/BF00121299</json:string></doi><id>5A59540EB3BBA7A7CE360FE6E0C84445B6444678</id><score>1.431715</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/5A59540EB3BBA7A7CE360FE6E0C84445B6444678/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/5A59540EB3BBA7A7CE360FE6E0C84445B6444678/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/5A59540EB3BBA7A7CE360FE6E0C84445B6444678/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A new simplicial cover technique in constrained global optimization</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><availability><p>Kluwer Academic Publishers, 1992</p></availability><date>1991-07-05</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">A new simplicial cover technique in constrained global optimization</title><author xml:id="author-1"><persName><forename type="first">R.</forename><surname>Horst</surname></persName><affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">N.</forename><surname>Thoai</surname></persName><affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</affiliation></author><author xml:id="author-3"><persName><forename type="first">J.</forename><surname>De Vries</surname></persName><affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</affiliation></author></analytic><monogr><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="journal-ID">10898</idno><idno type="pISSN">0925-5001</idno><idno type="eISSN">1573-2916</idno><idno type="issue-article-count">7</idno><idno type="volume-issue-count">4</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="1992-03-01"></date><biblScope unit="volume">2</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="1">1</biblScope><biblScope unit="page" to="19">19</biblScope></imprint></monogr><idno type="istex">5A59540EB3BBA7A7CE360FE6E0C84445B6444678</idno><idno type="DOI">10.1007/BF00121299</idno><idno type="ArticleID">BF00121299</idno><idno type="ArticleID">Art2</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1991-07-05</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: A simplicial branch and bound-outer approximation technique for solving nonseparable, nonlinearly constrained concave minimization problems is proposed which uses a new simplicial cover rather than classical simplicial partitions. Some geometric properties and convergence results are demonstrated. A report on numerical aspects and experiments is given which shows that the most promising variant of the cover technique can be expected to be more efficient than comparable previous simplicial procedures.</p></abstract><textClass><keywords scheme="Journal Subject"><list><head>Economics / Management Science</head><item><term>Computer Science, general</term></item><item><term>Real Functions</term></item><item><term>Optimization</term></item><item><term>Operation Research/Decision Theory</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1991-07-05">Created</change><change when="1992-03-01">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-23">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-21">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/5A59540EB3BBA7A7CE360FE6E0C84445B6444678/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Kluwer Academic Publishers</PublisherName><PublisherLocation>Dordrecht</PublisherLocation></PublisherInfo><Journal><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="Unnumbered"><JournalID>10898</JournalID><JournalPrintISSN>0925-5001</JournalPrintISSN><JournalElectronicISSN>1573-2916</JournalElectronicISSN><JournalTitle>Journal of Global Optimization</JournalTitle><JournalSubTitle>An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management, and Engineer</JournalSubTitle><JournalAbbreviatedTitle>J Glob Optim</JournalAbbreviatedTitle><JournalSubjectGroup><JournalSubject Type="Primary">Economics / Management Science</JournalSubject><JournalSubject Type="Secondary">Computer Science, general</JournalSubject><JournalSubject Type="Secondary">Real Functions</JournalSubject><JournalSubject Type="Secondary">Optimization</JournalSubject><JournalSubject Type="Secondary">Operation Research/Decision Theory</JournalSubject></JournalSubjectGroup></JournalInfo><Volume><VolumeInfo VolumeType="Regular" TocLevels="0"><VolumeIDStart>2</VolumeIDStart><VolumeIDEnd>2</VolumeIDEnd><VolumeIssueCount>4</VolumeIssueCount></VolumeInfo><Issue IssueType="Regular"><IssueInfo TocLevels="0"><IssueIDStart>1</IssueIDStart><IssueIDEnd>1</IssueIDEnd><IssueArticleCount>7</IssueArticleCount><IssueHistory><CoverDate><DateString>1992</DateString><Year>1992</Year><Month>3</Month></CoverDate></IssueHistory><IssueCopyright><CopyrightHolderName>Kluwer Academic Publishers</CopyrightHolderName><CopyrightYear>1992</CopyrightYear></IssueCopyright></IssueInfo><Article ID="Art2"><ArticleInfo Language="En" ArticleType="OriginalPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ArticleID>BF00121299</ArticleID><ArticleDOI>10.1007/BF00121299</ArticleDOI><ArticleSequenceNumber>2</ArticleSequenceNumber><ArticleTitle Language="En">A new simplicial cover technique in constrained global optimization</ArticleTitle><ArticleFirstPage>1</ArticleFirstPage><ArticleLastPage>19</ArticleLastPage><ArticleHistory><RegistrationDate><Year>2004</Year><Month>5</Month><Day>20</Day></RegistrationDate><Received><Year>1991</Year><Month>7</Month><Day>5</Day></Received><Accepted><Year>1991</Year><Month>10</Month><Day>8</Day></Accepted></ArticleHistory><ArticleCopyright><CopyrightHolderName>Kluwer Academic Publishers</CopyrightHolderName><CopyrightYear>1992</CopyrightYear></ArticleCopyright><ArticleGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ArticleGrants><ArticleContext><JournalID>10898</JournalID><VolumeIDStart>2</VolumeIDStart><VolumeIDEnd>2</VolumeIDEnd><IssueIDStart>1</IssueIDStart><IssueIDEnd>1</IssueIDEnd></ArticleContext></ArticleInfo><ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>R.</GivenName><FamilyName>Horst</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff1" PresentAffiliationID="Aff2"><AuthorName DisplayOrder="Western"><GivenName>N.</GivenName><GivenName>V.</GivenName><FamilyName>Thoai</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>J.</GivenName><Particle>De</Particle><FamilyName>Vries</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgDivision>Fachbereich IV-Mathematik</OrgDivision><OrgName>University of Trier</OrgName><OrgAddress><Postbox>P.O. Box 3825</Postbox><Postcode>5500</Postcode><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Institute of Mathematics</OrgName><OrgAddress><City>Hanoi</City></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>A simplicial branch and bound-outer approximation technique for solving nonseparable, nonlinearly constrained concave minimization problems is proposed which uses a new simplicial cover rather than classical simplicial partitions. Some geometric properties and convergence results are demonstrated. A report on numerical aspects and experiments is given which shows that the most promising variant of the cover technique can be expected to be more efficient than comparable previous simplicial procedures.</Para></Abstract><KeywordGroup Language="En"><Heading>Key words</Heading><Keyword>Constrained global optimization</Keyword><Keyword>concave minimization</Keyword><Keyword>simplicial covers</Keyword><Keyword>branch and bound</Keyword><Keyword>outer approximation</Keyword></KeywordGroup></ArticleHeader><NoBody></NoBody></Article></Issue></Volume></Journal></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>A new simplicial cover technique in constrained global optimization</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>A new simplicial cover technique in constrained global optimization</title></titleInfo><name type="personal"><namePart type="given">R.</namePart><namePart type="family">Horst</namePart><affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">N.</namePart><namePart type="given">V.</namePart><namePart type="family">Thoai</namePart><affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="family">De Vries</namePart><affiliation>Fachbereich IV-Mathematik, University of Trier, P.O. Box 3825, 5500, Trier, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper"></genre><originInfo><publisher>Kluwer Academic Publishers</publisher><place><placeTerm type="text">Dordrecht</placeTerm></place><dateCreated encoding="w3cdtf">1991-07-05</dateCreated><dateIssued encoding="w3cdtf">1992-03-01</dateIssued><copyrightDate encoding="w3cdtf">1992</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: A simplicial branch and bound-outer approximation technique for solving nonseparable, nonlinearly constrained concave minimization problems is proposed which uses a new simplicial cover rather than classical simplicial partitions. Some geometric properties and convergence results are demonstrated. A report on numerical aspects and experiments is given which shows that the most promising variant of the cover technique can be expected to be more efficient than comparable previous simplicial procedures.</abstract><relatedItem type="host"><titleInfo><title>Journal of Global Optimization</title><subTitle>An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management, and Engineer</subTitle></titleInfo><titleInfo type="abbreviated"><title>J Glob Optim</title></titleInfo><genre type="journal" displayLabel="Archive Journal"></genre><originInfo><dateIssued encoding="w3cdtf">1992-03-01</dateIssued><copyrightDate encoding="w3cdtf">1992</copyrightDate></originInfo><subject><genre>Economics / Management Science</genre><topic>Computer Science, general</topic><topic>Real Functions</topic><topic>Optimization</topic><topic>Operation Research/Decision Theory</topic></subject><identifier type="ISSN">0925-5001</identifier><identifier type="eISSN">1573-2916</identifier><identifier type="JournalID">10898</identifier><identifier type="IssueArticleCount">7</identifier><identifier type="VolumeIssueCount">4</identifier><part><date>1992</date><detail type="volume"><number>2</number><caption>vol.</caption></detail><detail type="issue"><number>1</number><caption>no.</caption></detail><extent unit="pages"><start>1</start><end>19</end></extent></part><recordInfo><recordOrigin>Kluwer Academic Publishers, 1992</recordOrigin></recordInfo></relatedItem><identifier type="istex">5A59540EB3BBA7A7CE360FE6E0C84445B6444678</identifier><identifier type="DOI">10.1007/BF00121299</identifier><identifier type="ArticleID">BF00121299</identifier><identifier type="ArticleID">Art2</identifier><accessCondition type="use and reproduction" contentType="copyright">Kluwer Academic Publishers, 1992</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Kluwer Academic Publishers, 1992</recordOrigin></recordInfo></mods></metadata><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001056 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001056 | 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= Corpus
|type= RBID
|clé= ISTEX:5A59540EB3BBA7A7CE360FE6E0C84445B6444678
|texte= A new simplicial cover technique in constrained global optimization
}}
| This area was generated with Dilib version V0.6.31. |  |