Outer approximation by polyhedral convex sets
Identifieur interne : 000E56 ( Istex/Corpus ); précédent : 000E55; suivant : 000E57Outer approximation by polyhedral convex sets
Auteurs : R. Horst ; Ng. V. Thoai ; H. TuySource :
- Operations-Research-Spektrum [ 0171-6468 ] ; 1987-09-01.
Abstract
Summary: This paper deals with outer approximation methods for solving possibly multiextremal global optimization problems. A general theorem on convergence is presented and new classes of outer approximation methods using polyhedral convex sets are derived. The underlying theory is then related to the cut map-separator theory of Eaves and Zangwill. Two constraint dropping strategies are deduced.
Url:
DOI: 10.1007/BF01721096
Links to Exploration step
ISTEX:663AD5CE69A9C24FF21C8352D35A36939F7CB170Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Outer approximation by polyhedral convex sets</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, Universität Trier, Postfach 3825, D-5500, Trier, Federal Republic of Germany</mods:affiliation></affiliation></author><author><name sortKey="Thoai, Ng V" sort="Thoai, Ng V" uniqKey="Thoai N" first="Ng. V." last="Thoai">Ng. V. Thoai</name><affiliation><mods:affiliation>Institute of Mathematics, BO HO, P.O. Box 631, Hanoi, Vietnam</mods:affiliation></affiliation></author><author><name sortKey="Tuy, H" sort="Tuy, H" uniqKey="Tuy H" first="H." last="Tuy">H. Tuy</name><affiliation><mods:affiliation>Institute of Mathematics, BO HO, P.O. Box 631, Hanoi, Vietnam</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:663AD5CE69A9C24FF21C8352D35A36939F7CB170</idno><date when="1987" year="1987">1987</date><idno type="doi">10.1007/BF01721096</idno><idno type="url">https://api.istex.fr/document/663AD5CE69A9C24FF21C8352D35A36939F7CB170/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000E56</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000E56</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Outer approximation by polyhedral convex sets</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, Universität Trier, Postfach 3825, D-5500, Trier, Federal Republic of Germany</mods:affiliation></affiliation></author><author><name sortKey="Thoai, Ng V" sort="Thoai, Ng V" uniqKey="Thoai N" first="Ng. V." last="Thoai">Ng. V. Thoai</name><affiliation><mods:affiliation>Institute of Mathematics, BO HO, P.O. Box 631, Hanoi, Vietnam</mods:affiliation></affiliation></author><author><name sortKey="Tuy, H" sort="Tuy, H" uniqKey="Tuy H" first="H." last="Tuy">H. Tuy</name><affiliation><mods:affiliation>Institute of Mathematics, BO HO, P.O. Box 631, Hanoi, Vietnam</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Operations-Research-Spektrum</title><title level="j" type="abbrev">OR Spektrum</title><idno type="ISSN">0171-6468</idno><idno type="eISSN">1436-6304</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><date type="published" when="1987-09-01">1987-09-01</date><biblScope unit="volume">9</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="153">153</biblScope><biblScope unit="page" to="159">159</biblScope></imprint><idno type="ISSN">0171-6468</idno></series><idno type="istex">663AD5CE69A9C24FF21C8352D35A36939F7CB170</idno><idno type="DOI">10.1007/BF01721096</idno><idno type="ArticleID">BF01721096</idno><idno type="ArticleID">Art3</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0171-6468</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Summary: This paper deals with outer approximation methods for solving possibly multiextremal global optimization problems. A general theorem on convergence is presented and new classes of outer approximation methods using polyhedral convex sets are derived. The underlying theory is then related to the cut map-separator theory of Eaves and Zangwill. Two constraint dropping strategies are deduced.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>R. Horst</name><affiliations><json:string>Fachbereich IV - Mathematik, Universität Trier, Postfach 3825, D-5500, Trier, Federal Republic of Germany</json:string></affiliations></json:item><json:item><name>Ng. V. Thoai</name><affiliations><json:string>Institute of Mathematics, BO HO, P.O. Box 631, Hanoi, Vietnam</json:string></affiliations></json:item><json:item><name>H. Tuy</name><affiliations><json:string>Institute of Mathematics, BO HO, P.O. Box 631, Hanoi, Vietnam</json:string></affiliations></json:item></author><articleId><json:string>BF01721096</json:string><json:string>Art3</json:string></articleId><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Summary: This paper deals with outer approximation methods for solving possibly multiextremal global optimization problems. A general theorem on convergence is presented and new classes of outer approximation methods using polyhedral convex sets are derived. The underlying theory is then related to the cut map-separator theory of Eaves and Zangwill. Two constraint dropping strategies are deduced.</abstract><qualityIndicators><score>5.322</score><pdfVersion>1.3</pdfVersion><pdfPageSize>597.28 x 785 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>399</abstractCharCount><pdfWordCount>4650</pdfWordCount><pdfCharCount>20000</pdfCharCount><pdfPageCount>7</pdfPageCount><abstractWordCount>56</abstractWordCount></qualityIndicators><title>Outer approximation by polyhedral convex sets</title><refBibs><json:item><author><json:item><name>Ew Cheney</name></json:item><json:item><name>Aa Goldstein</name></json:item></author><host><volume>1</volume><pages><last>268</last><first>253</first></pages><author></author><title>Numer Math</title><publicationDate>1959</publicationDate></host><title>Newton's method for convex programming and Tchebycheff approximation</title><publicationDate>1959</publicationDate></json:item><json:item><author><json:item><name>Bc Eaves</name></json:item><json:item><name>Wi Zangwill</name></json:item></author><host><volume>9</volume><pages><last>542</last><first>529</first></pages><author></author><title>SIAM J Control</title><publicationDate>1971</publicationDate></host><title>Generalized cutting plane algorithms</title><publicationDate>1971</publicationDate></json:item><json:item><author><json:item><name>J Falk</name></json:item><json:item><name>Kr Hoffman</name></json:item></author><host><volume>1</volume><pages><last>259</last><first>251</first></pages><author></author><title>Math Oper Res</title><publicationDate>1976</publicationDate></host><title>A successive underestimation method for concave minimization problems</title><publicationDate>1976</publicationDate></json:item><json:item><author><json:item><name>M Fukushima</name></json:item></author><host><volume>31</volume><pages><last>113</last><first>101</first></pages><author></author><title>Oper Res</title><publicationDate>1983</publicationDate></host><title>An outer approximation algorithm for solving general convex programs</title><publicationDate>1983</publicationDate></json:item><json:item><author><json:item><name>M Fukushima</name></json:item></author><host><volume>10</volume><pages><last>156</last><first>147</first></pages><author></author><title>J Comput Appl Math</title><publicationDate>1984</publicationDate></host><title>On the convergence of a class of outer approximation algorithms for convex programs</title><publicationDate>1984</publicationDate></json:item><json:item><author><json:item><name>Kr Hoffman</name></json:item></author><host><volume>20</volume><pages><last>32</last><first>22</first></pages><author></author><title>Math Programm</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>Ww Hogan</name></json:item></author><host><volume>5</volume><pages><last>168</last><first>151</first></pages><author></author><title>Math Programm</title><publicationDate>1973</publicationDate></host><title>Applications of a general convergence theory for outer approximation algorithms</title><publicationDate>1973</publicationDate></json:item><json:item><author><json:item><name>Je Kelley</name></json:item></author><host><volume>8</volume><pages><last>712</last><first>703</first></pages><author></author><title>J SIAM</title><publicationDate>1960</publicationDate></host><title>The cutting -plane method for solving convex programs</title><publicationDate>1960</publicationDate></json:item><json:item><author><json:item><name>Es Leviting</name></json:item><json:item><name>Bt Polyak</name></json:item></author><host><volume>6</volume><pages><last>50</last><first>1</first></pages><author></author><title>USSR Comput Math Math Phys</title><publicationDate>1966</publicationDate></host><title>Constrained minimization methods</title><publicationDate>1966</publicationDate></json:item><json:item><author><json:item><name>Dq Mayne</name></json:item><json:item><name>E Polak</name></json:item></author><host><volume>142</volume><pages><last>30</last><first>19</first></pages><author></author><title>J Optimization Theory</title><publicationDate>1984</publicationDate></host><title>Outer approximation algorithm for nondifferentiable optimization problems</title><publicationDate>1984</publicationDate></json:item><json:item><author><json:item><name>Sc Parikh</name></json:item></author><host><volume>11</volume><pages><last>198</last><first>184</first></pages><author></author><title>Math Programm</title><publicationDate>1976</publicationDate></host><title>Approximate cutting planes in nonlinear programming</title><publicationDate>1976</publicationDate></json:item><json:item><host><author><json:item><name>Rt Rockafellar</name></json:item></author><title>Convex analysis</title><publicationDate>1970</publicationDate></host></json:item><json:item><author><json:item><name>Tv Thieu</name></json:item><json:item><name>Bt Tam</name></json:item><json:item><name>Vt Ban</name></json:item></author><host><volume>8</volume><pages><last>40</last><first>21</first></pages><author></author><title>Acta Math Vietnam</title><publicationDate>1983</publicationDate></host><title>An outer approximation method for global minimizing a concave function over a compact convex set</title><publicationDate>1983</publicationDate></json:item><json:item><host><author><json:item><name>Thoai Ng</name></json:item><json:item><name>V </name></json:item></author><title>Verfahren zur L6sung konkaver Optimierungsaufgaben . Seminarberichte</title><publicationDate>1984</publicationDate></host></json:item><json:item><author></author><host><volume>18</volume><pages><last>413</last><first>404</first></pages><author></author><title>Topkis DM Oper Res</title><publicationDate>1970</publicationDate></host><title>Cutting plane methods without nested constraint sets</title><publicationDate>1970</publicationDate></json:item><json:item><host><author><json:item><name>H Tuy</name></json:item><json:item><name>R Horst</name></json:item></author><title>Convergence and restart in branchand-bound algorithms for global optimization. Application to concave minimization and D. C. optimization problems</title><publicationDate>1986</publicationDate></host></json:item><json:item><author><json:item><name>Af Veinott</name></json:item></author><host><volume>15</volume><pages><last>152</last><first>147</first></pages><author></author><title>Oper Res</title><publicationDate>1967</publicationDate></host><title>The supporting hyperplane method for unimodal programming</title><publicationDate>1967</publicationDate></json:item></refBibs><genre><json:string>research-article</json:string></genre><host><volume>9</volume><pages><last>159</last><first>153</first></pages><issn><json:string>0171-6468</json:string></issn><issue>3</issue><subject><json:item><value>Calculus of Variations and Optimal Control</value></json:item><json:item><value>Optimization</value></json:item><json:item><value>Business/Management Science, general</value></json:item><json:item><value>Operation Research/Decision Theory</value></json:item></subject><journalId><json:string>291</json:string></journalId><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1436-6304</json:string></eissn><title>Operations-Research-Spektrum</title><publicationDate>1987</publicationDate><copyrightDate>1987</copyrightDate></host><categories><wos><json:string>science</json:string><json:string>operations research & management science</json:string></wos><scienceMetrix><json:string>applied sciences</json:string><json:string>engineering</json:string><json:string>operations research</json:string></scienceMetrix></categories><publicationDate>1987</publicationDate><copyrightDate>1987</copyrightDate><doi><json:string>10.1007/BF01721096</json:string></doi><id>663AD5CE69A9C24FF21C8352D35A36939F7CB170</id><score>0.831623</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/663AD5CE69A9C24FF21C8352D35A36939F7CB170/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/663AD5CE69A9C24FF21C8352D35A36939F7CB170/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/663AD5CE69A9C24FF21C8352D35A36939F7CB170/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Outer approximation by polyhedral convex sets</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>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><availability><p>Springer-Verlag, 1987</p></availability><date>1986-02-04</date></publicationStmt><notesStmt><note>Theoretical Papers</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Outer approximation by polyhedral convex sets</title><author xml:id="author-1"><persName><forename type="first">R.</forename><surname>Horst</surname></persName><affiliation>Fachbereich IV - Mathematik, Universität Trier, Postfach 3825, D-5500, Trier, Federal Republic of Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">Ng.</forename><surname>Thoai</surname></persName><affiliation>Institute of Mathematics, BO HO, P.O. Box 631, Hanoi, Vietnam</affiliation></author><author xml:id="author-3"><persName><forename type="first">H.</forename><surname>Tuy</surname></persName><affiliation>Institute of Mathematics, BO HO, P.O. Box 631, Hanoi, Vietnam</affiliation></author></analytic><monogr><title level="j">Operations-Research-Spektrum</title><title level="j" type="abbrev">OR Spektrum</title><idno type="journal-ID">291</idno><idno type="pISSN">0171-6468</idno><idno type="eISSN">1436-6304</idno><idno type="issue-article-count">12</idno><idno type="volume-issue-count">4</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><date type="published" when="1987-09-01"></date><biblScope unit="volume">9</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="153">153</biblScope><biblScope unit="page" to="159">159</biblScope></imprint></monogr><idno type="istex">663AD5CE69A9C24FF21C8352D35A36939F7CB170</idno><idno type="DOI">10.1007/BF01721096</idno><idno type="ArticleID">BF01721096</idno><idno type="ArticleID">Art3</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1986-02-04</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Summary: This paper deals with outer approximation methods for solving possibly multiextremal global optimization problems. A general theorem on convergence is presented and new classes of outer approximation methods using polyhedral convex sets are derived. The underlying theory is then related to the cut map-separator theory of Eaves and Zangwill. Two constraint dropping strategies are deduced.</p></abstract><abstract xml:lang="de"><p>Zusammenfassung: Diese Arbeit befaßt sich mit äußeren Approximationsverfahren zur Lösung von möglicherweise multiextremalen globalen Optimierungsproblemen. Ein allgemeiner Konvergenzsatz wird vorgestellt, aus dem sich neue Klassen von Schnittebenenverfahren ableiten lassen. Schließlich wird die dargestellte Theorie in Bezug gesetzt zur Schnittabbildung-Separatoren-Theorie von Eaves und Zangwill. Zwei Strategien zur Reduzierung der Nebenbedingungen werden vorgestellt.</p></abstract><textClass><keywords scheme="Journal Subject"><list><head>Economics / Management Science</head><item><term>Calculus of Variations and Optimal Control</term></item><item><term>Optimization</term></item><item><term>Business/Management Science, general</term></item><item><term>Operation Research/Decision Theory</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1986-02-04">Created</change><change when="1987-09-01">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-11-22">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-01-20">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/663AD5CE69A9C24FF21C8352D35A36939F7CB170/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>Springer-Verlag</PublisherName><PublisherLocation>Berlin/Heidelberg</PublisherLocation></PublisherInfo><Journal><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="Unnumbered"><JournalID>291</JournalID><JournalPrintISSN>0171-6468</JournalPrintISSN><JournalElectronicISSN>1436-6304</JournalElectronicISSN><JournalTitle>Operations-Research-Spektrum</JournalTitle><JournalAbbreviatedTitle>OR Spektrum</JournalAbbreviatedTitle><JournalSubjectGroup><JournalSubject Type="Primary">Economics / Management Science</JournalSubject><JournalSubject Type="Secondary">Calculus of Variations and Optimal Control</JournalSubject><JournalSubject Type="Secondary">Optimization</JournalSubject><JournalSubject Type="Secondary">Business/Management Science, general</JournalSubject><JournalSubject Type="Secondary">Operation Research/Decision Theory</JournalSubject></JournalSubjectGroup></JournalInfo><Volume><VolumeInfo VolumeType="Regular" TocLevels="0"><VolumeIDStart>9</VolumeIDStart><VolumeIDEnd>9</VolumeIDEnd><VolumeIssueCount>4</VolumeIssueCount></VolumeInfo><Issue IssueType="Regular"><IssueInfo TocLevels="0"><IssueIDStart>3</IssueIDStart><IssueIDEnd>3</IssueIDEnd><IssueArticleCount>12</IssueArticleCount><IssueHistory><CoverDate><DateString>1987</DateString><Year>1987</Year><Month>9</Month></CoverDate></IssueHistory><IssueCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1987</CopyrightYear></IssueCopyright></IssueInfo><Article ID="Art3"><ArticleInfo Language="En" ArticleType="OriginalPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ArticleID>BF01721096</ArticleID><ArticleDOI>10.1007/BF01721096</ArticleDOI><ArticleSequenceNumber>3</ArticleSequenceNumber><ArticleTitle Language="En">Outer approximation by polyhedral convex sets</ArticleTitle><ArticleCategory>Theoretical Papers</ArticleCategory><ArticleFirstPage>153</ArticleFirstPage><ArticleLastPage>159</ArticleLastPage><ArticleHistory><RegistrationDate><Year>2005</Year><Month>5</Month><Day>3</Day></RegistrationDate><Received><Year>1986</Year><Month>2</Month><Day>4</Day></Received><Accepted><Year>1987</Year><Month>5</Month><Day>19</Day></Accepted></ArticleHistory><ArticleCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1987</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>291</JournalID><VolumeIDStart>9</VolumeIDStart><VolumeIDEnd>9</VolumeIDEnd><IssueIDStart>3</IssueIDStart><IssueIDEnd>3</IssueIDEnd></ArticleContext></ArticleInfo><ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>R.</GivenName><FamilyName>Horst</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>Ng.</GivenName><GivenName>V.</GivenName><FamilyName>Thoai</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>H.</GivenName><FamilyName>Tuy</FamilyName></AuthorName></Author><Affiliation ID="Aff1"><OrgDivision>Fachbereich IV - Mathematik</OrgDivision><OrgName>Universität Trier</OrgName><OrgAddress><Postbox>Postfach 3825</Postbox><Postcode>D-5500</Postcode><City>Trier</City><Country>Federal Republic of Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Institute of Mathematics</OrgName><OrgAddress><Street>BO HO</Street><Postbox>P.O. Box 631</Postbox><City>Hanoi</City><Country>Vietnam</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Summary</Heading><Para>This paper deals with outer approximation methods for solving possibly multiextremal global optimization problems. A general theorem on convergence is presented and new classes of outer approximation methods using polyhedral convex sets are derived. The underlying theory is then related to the cut map-separator theory of Eaves and Zangwill. Two constraint dropping strategies are deduced.</Para></Abstract><Abstract ID="Abs2" Language="De"><Heading>Zusammenfassung</Heading><Para>Diese Arbeit befaßt sich mit äußeren Approximationsverfahren zur Lösung von möglicherweise multiextremalen globalen Optimierungsproblemen. Ein allgemeiner Konvergenzsatz wird vorgestellt, aus dem sich neue Klassen von Schnittebenenverfahren ableiten lassen. Schließlich wird die dargestellte Theorie in Bezug gesetzt zur Schnittabbildung-Separatoren-Theorie von Eaves und Zangwill. Zwei Strategien zur Reduzierung der Nebenbedingungen werden vorgestellt.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>This research was accomplished while this author was with the University of Trier as a fellow of the Alexander von Humboldtfoundation</SimplePara></ArticleNote></ArticleHeader><NoBody></NoBody></Article></Issue></Volume></Journal></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Outer approximation by polyhedral convex sets</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Outer approximation by polyhedral convex sets</title></titleInfo><name type="personal"><namePart type="given">R.</namePart><namePart type="family">Horst</namePart><affiliation>Fachbereich IV - Mathematik, Universität Trier, Postfach 3825, D-5500, Trier, Federal Republic of Germany</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Ng.</namePart><namePart type="given">V.</namePart><namePart type="family">Thoai</namePart><affiliation>Institute of Mathematics, BO HO, P.O. Box 631, Hanoi, Vietnam</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">H.</namePart><namePart type="family">Tuy</namePart><affiliation>Institute of Mathematics, BO HO, P.O. Box 631, Hanoi, Vietnam</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer-Verlag</publisher><place><placeTerm type="text">Berlin/Heidelberg</placeTerm></place><dateCreated encoding="w3cdtf">1986-02-04</dateCreated><dateIssued encoding="w3cdtf">1987-09-01</dateIssued><copyrightDate encoding="w3cdtf">1987</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">Summary: This paper deals with outer approximation methods for solving possibly multiextremal global optimization problems. A general theorem on convergence is presented and new classes of outer approximation methods using polyhedral convex sets are derived. The underlying theory is then related to the cut map-separator theory of Eaves and Zangwill. Two constraint dropping strategies are deduced.</abstract><abstract lang="de">Zusammenfassung: Diese Arbeit befaßt sich mit äußeren Approximationsverfahren zur Lösung von möglicherweise multiextremalen globalen Optimierungsproblemen. Ein allgemeiner Konvergenzsatz wird vorgestellt, aus dem sich neue Klassen von Schnittebenenverfahren ableiten lassen. Schließlich wird die dargestellte Theorie in Bezug gesetzt zur Schnittabbildung-Separatoren-Theorie von Eaves und Zangwill. Zwei Strategien zur Reduzierung der Nebenbedingungen werden vorgestellt.</abstract><note>Theoretical Papers</note><relatedItem type="host"><titleInfo><title>Operations-Research-Spektrum</title></titleInfo><titleInfo type="abbreviated"><title>OR Spektrum</title></titleInfo><genre type="journal" displayLabel="Archive Journal"></genre><originInfo><dateIssued encoding="w3cdtf">1987-09-01</dateIssued><copyrightDate encoding="w3cdtf">1987</copyrightDate></originInfo><subject><genre>Economics / Management Science</genre><topic>Calculus of Variations and Optimal Control</topic><topic>Optimization</topic><topic>Business/Management Science, general</topic><topic>Operation Research/Decision Theory</topic></subject><identifier type="ISSN">0171-6468</identifier><identifier type="eISSN">1436-6304</identifier><identifier type="JournalID">291</identifier><identifier type="IssueArticleCount">12</identifier><identifier type="VolumeIssueCount">4</identifier><part><date>1987</date><detail type="volume"><number>9</number><caption>vol.</caption></detail><detail type="issue"><number>3</number><caption>no.</caption></detail><extent unit="pages"><start>153</start><end>159</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1987</recordOrigin></recordInfo></relatedItem><identifier type="istex">663AD5CE69A9C24FF21C8352D35A36939F7CB170</identifier><identifier type="DOI">10.1007/BF01721096</identifier><identifier type="ArticleID">BF01721096</identifier><identifier type="ArticleID">Art3</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1987</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag, 1987</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 000E56 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000E56 | 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:663AD5CE69A9C24FF21C8352D35A36939F7CB170
|texte= Outer approximation by polyhedral convex sets
}}
| This area was generated with Dilib version V0.6.31. |  |