UnivTrevesV1, Istex, Corpus, bibRecord, 000E96

Normal conical algorithm for concave minimization over polytopes

Identifieur interne : 000E96 ( Istex/Corpus ); précédent : 000E95; suivant : 000E97

Normal conical algorithm for concave minimization over polytopes

Auteurs : Hoang Tuy

Source :

Mathematical Programming [ 0025-5610 ] ; 1991-07-01.

RBID : ISTEX:680AB0AF912957836C85C45D7294C1F0CA202820

Abstract

Abstract: A new conical algorithm is developed for finding the global minimum of a concave function over a polytope. To ensure faster convergence and overcome some major drawbacks of previous conical algorithms, a normal (rather than exhaustive) subdivision process is used.

Url:

https://api.istex.fr/document/680AB0AF912957836C85C45D7294C1F0CA202820/fulltext/pdf

DOI: 10.1007/BF01586935

Links to Exploration step

ISTEX:680AB0AF912957836C85C45D7294C1F0CA202820

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Normal conical algorithm for concave minimization over polytopes</title>
<author><name sortKey="Tuy, Hoang" sort="Tuy, Hoang" uniqKey="Tuy H" first="Hoang" last="Tuy">Hoang Tuy</name>
<affiliation><mods:affiliation>Institute of Mathematics, P.O. Box 631, Bo Ho, Hanoi, Vietnam</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:680AB0AF912957836C85C45D7294C1F0CA202820</idno>
<date when="1991" year="1991">1991</date>
<idno type="doi">10.1007/BF01586935</idno>
<idno type="url">https://api.istex.fr/document/680AB0AF912957836C85C45D7294C1F0CA202820/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000E96</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000E96</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Normal conical algorithm for concave minimization over polytopes</title>
<author><name sortKey="Tuy, Hoang" sort="Tuy, Hoang" uniqKey="Tuy H" first="Hoang" last="Tuy">Hoang Tuy</name>
<affiliation><mods:affiliation>Institute of Mathematics, P.O. Box 631, Bo Ho, Hanoi, Vietnam</mods:affiliation>
</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="1991-07-01">1991-07-01</date>
<biblScope unit="volume">51</biblScope>
<biblScope unit="issue">1-3</biblScope>
<biblScope unit="page" from="229">229</biblScope>
<biblScope unit="page" to="245">245</biblScope>
</imprint>
<idno type="ISSN">0025-5610</idno>
</series>
<idno type="istex">680AB0AF912957836C85C45D7294C1F0CA202820</idno>
<idno type="DOI">10.1007/BF01586935</idno>
<idno type="ArticleID">BF01586935</idno>
<idno type="ArticleID">Art13</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 new conical algorithm is developed for finding the global minimum of a concave function over a polytope. To ensure faster convergence and overcome some major drawbacks of previous conical algorithms, a normal (rather than exhaustive) subdivision process is used.</div>
</front>
</TEI>
<istex><corpusName>springer</corpusName>
<author><json:item><name>Hoang Tuy</name>
<affiliations><json:string>Institute of Mathematics, P.O. Box 631, Bo Ho, Hanoi, Vietnam</json:string>
</affiliations>
</json:item>
</author>
<articleId><json:string>BF01586935</json:string>
<json:string>Art13</json:string>
</articleId>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: A new conical algorithm is developed for finding the global minimum of a concave function over a polytope. To ensure faster convergence and overcome some major drawbacks of previous conical algorithms, a normal (rather than exhaustive) subdivision process is used.</abstract>
<qualityIndicators><score>5.492</score>
<pdfVersion>1.3</pdfVersion>
<pdfPageSize>447 x 666 pts</pdfPageSize>
<refBibsNative>false</refBibsNative>
<keywordCount>0</keywordCount>
<abstractCharCount>274</abstractCharCount>
<pdfWordCount>8776</pdfWordCount>
<pdfCharCount>34932</pdfCharCount>
<pdfPageCount>17</pdfPageCount>
<abstractWordCount>41</abstractWordCount>
</qualityIndicators>
<title>Normal conical algorithm for concave minimization over polytopes</title>
<refBibs><json:item><host><author><json:item><name>S Bali</name>
</json:item>
</author>
<title>Minimization of a concave function on a bounded convex polyhedron</title>
<publicationDate>1973</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>V,P Bulatov</name>
</json:item>
</author>
<host><author></author>
<title>Metody Pogrujeniia v Zadatehak Optimizatsii (Nauka, Sibirskoe Otdelenie</title>
<publicationDate>1977</publicationDate>
</host>
<publicationDate>1977</publicationDate>
</json:item>
<json:item><author><json:item><name>M Hamami</name>
</json:item>
<json:item><name>S,E Jacobsen</name>
</json:item>
</author>
<host><volume>13</volume>
<pages><last>487</last>
<first>479</first>
</pages>
<author></author>
<title>Mathematics of Operations Research</title>
<publicationDate>1988</publicationDate>
</host>
<title>Exhaustive nondegenerate conical processes for concave minimization on convex polytopes</title>
<publicationDate>1988</publicationDate>
</json:item>
<json:item><author><json:item><name>R Horst</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>6</volume>
<pages><last>205</last>
<first>195</first>
</pages>
<author></author>
<title>Operations Research Spektrum</title>
<publicationDate>1984</publicationDate>
</host>
<title>On the global minimization of concave functions: Introduction and survey</title>
<publicationDate>1984</publicationDate>
</json:item>
<json:item><host><author><json:item><name>R Horst</name>
</json:item>
<json:item><name>V Ng</name>
</json:item>
<json:item><name> Thoai</name>
</json:item>
</author>
<title>Implementation, modification and comparison of some algorithms for concave minimization problems</title>
<publicationDate>1988</publicationDate>
</host>
</json:item>
<json:item><author><json:item><name>S,E Jacobsen</name>
</json:item>
</author>
<host><volume>7</volume>
<pages><last>9</last>
<first>1</first>
</pages>
<author></author>
<title>Applied Mathematics and Optimization</title>
<publicationDate>1981</publicationDate>
</host>
<title>Convergence of a Tuy-type algorithm for concave minimization subject to linear constraints</title>
<publicationDate>1981</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><volume>26</volume>
<pages><last>379</last>
<first>367</first>
</pages>
<author></author>
<title>SIAM Review</title>
<publicationDate>1986</publicationDate>
</host>
<title>Methods for global concave minimization: a bibliographic survey</title>
<publicationDate>1986</publicationDate>
</json:item>
<json:item><author><json:item><name>V Ng</name>
</json:item>
<json:item><name>H Thoai</name>
</json:item>
<json:item><name> Tuy</name>
</json:item>
</author>
<host><volume>5</volume>
<pages><last>566</last>
<first>556</first>
</pages>
<author></author>
<title>Mathematics of Operations Research</title>
<publicationDate>1980</publicationDate>
</host>
<title>Convergent algorithm for minimizing a concave function</title>
<publicationDate>1980</publicationDate>
</json:item>
<json:item><author><json:item><name>V Ng</name>
</json:item>
<json:item><name>J Thoai</name>
</json:item>
<json:item><name> De Vries</name>
</json:item>
</author>
<host><author></author>
<title>Methods of Operations Research</title>
</host>
<title>Numerical experiments on concave minimization algorithms</title>
</json:item>
<json:item><author><json:item><name>H Tuy</name>
</json:item>
</author>
<host><pages><last>35</last>
<first>32</first>
</pages>
<author></author>
<title>Doklady A N SSSR 158</title>
<publicationDate>1964</publicationDate>
</host>
<title>Vognutoe programmirovaniie pri Iineinyk ogranitchenyakhConcave programming under linear constraints</title>
<publicationDate>1964</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>Q Ng</name>
</json:item>
<json:item><name> Thai</name>
</json:item>
</author>
<host><volume>10</volume>
<pages><last>514</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>H Tuy</name>
</json:item>
<json:item><name>V Khachaturov</name>
</json:item>
<json:item><name>S Utkin</name>
</json:item>
</author>
<host><volume>18</volume>
<pages><last>808</last>
<first>791</first>
</pages>
<author></author>
<title>Optimization</title>
<publicationDate>1987</publicationDate>
</host>
<title>A class of exhaustive cone splitting procedures in conical algorithms for concave minimization</title>
<publicationDate>1987</publicationDate>
</json:item>
<json:item><author><json:item><name>H Tuy</name>
</json:item>
</author>
<host><author></author>
<title>Fermat Days Mathematics for Optimization. Mathematics Studies Series</title>
<publicationDate>1985</publicationDate>
</host>
<title>A general deterministic approach to global optimization via D.C. programming</title>
<publicationDate>1985</publicationDate>
</json:item>
<json:item><host><author><json:item><name>H Tuy</name>
</json:item>
</author>
<title>On polyhedral annexation method for concave minimization," submitted for publication</title>
</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>184</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 algorithms</title>
<publicationDate>1988</publicationDate>
</json:item>
<json:item><author><json:item><name>P,B Zwart</name>
</json:item>
</author>
<host><volume>21</volume>
<pages><last>1266</last>
<first>1260</first>
</pages>
<author></author>
<title>Operations Research</title>
<publicationDate>1973</publicationDate>
</host>
<title>Nonlinear Programming: counterexamples to two global optimization algorithms</title>
<publicationDate>1973</publicationDate>
</json:item>
<json:item><author><json:item><name>P,B Zwart</name>
</json:item>
</author>
<host><volume>22</volume>
<pages><last>609</last>
<first>602</first>
</pages>
<author></author>
<title>Operations Research</title>
<publicationDate>1974</publicationDate>
</host>
<title>Global maximization of a convex function with linear inequality constraints</title>
<publicationDate>1974</publicationDate>
</json:item>
</refBibs>
<genre><json:string>research-article</json:string>
</genre>
<host><volume>51</volume>
<pages><last>245</last>
<first>229</first>
</pages>
<issn><json:string>0025-5610</json:string>
</issn>
<issue>1-3</issue>
<subject><json:item><value>Mathematics of Computing</value>
</json:item>
<json:item><value>Numerical Analysis</value>
</json:item>
<json:item><value>Combinatorics</value>
</json:item>
<json:item><value>Calculus of Variations and Optimal Control</value>
</json:item>
<json:item><value>Optimization</value>
</json:item>
<json:item><value>Mathematical and Computational Physics</value>
</json:item>
<json:item><value>Mathematical Methods in Physics</value>
</json:item>
<json:item><value>Numerical and Computational Methods</value>
</json:item>
<json:item><value>Operation Research/Decision Theory</value>
</json:item>
</subject>
<journalId><json:string>10107</json:string>
</journalId>
<genre><json:string>journal</json:string>
</genre>
<language><json:string>unknown</json:string>
</language>
<eissn><json:string>1436-4646</json:string>
</eissn>
<title>Mathematical Programming</title>
<publicationDate>1991</publicationDate>
<copyrightDate>1991</copyrightDate>
</host>
<categories><wos><json:string>science</json:string>
<json:string>operations research & management science</json:string>
<json:string>mathematics, applied</json:string>
<json:string>computer science, software engineering</json:string>
</wos>
<scienceMetrix><json:string>applied sciences</json:string>
<json:string>engineering</json:string>
<json:string>operations research</json:string>
</scienceMetrix>
</categories>
<publicationDate>1991</publicationDate>
<copyrightDate>1991</copyrightDate>
<doi><json:string>10.1007/BF01586935</json:string>
</doi>
<id>680AB0AF912957836C85C45D7294C1F0CA202820</id>
<score>0.019275751</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/document/680AB0AF912957836C85C45D7294C1F0CA202820/fulltext/pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/document/680AB0AF912957836C85C45D7294C1F0CA202820/fulltext/zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/document/680AB0AF912957836C85C45D7294C1F0CA202820/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Normal conical algorithm for concave minimization over polytopes</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>The Mathematical Programming Society, Inc., 1991</p>
</availability>
<date>1988-08-19</date>
</publicationStmt>
<sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Normal conical algorithm for concave minimization over polytopes</title>
<author xml:id="author-1"><persName><forename type="first">Hoang</forename>
<surname>Tuy</surname>
</persName>
<affiliation>Institute of Mathematics, P.O. Box 631, Bo Ho, Hanoi, Vietnam</affiliation>
</author>
</analytic>
<monogr><title level="j">Mathematical Programming</title>
<title level="j" type="abbrev">Mathematical Programming</title>
<idno type="journal-ID">10107</idno>
<idno type="pISSN">0025-5610</idno>
<idno type="eISSN">1436-4646</idno>
<idno type="issue-article-count">25</idno>
<idno type="volume-issue-count">3</idno>
<imprint><publisher>Springer-Verlag</publisher>
<pubPlace>Berlin/Heidelberg</pubPlace>
<date type="published" when="1991-07-01"></date>
<biblScope unit="volume">51</biblScope>
<biblScope unit="issue">1-3</biblScope>
<biblScope unit="page" from="229">229</biblScope>
<biblScope unit="page" to="245">245</biblScope>
</imprint>
</monogr>
<idno type="istex">680AB0AF912957836C85C45D7294C1F0CA202820</idno>
<idno type="DOI">10.1007/BF01586935</idno>
<idno type="ArticleID">BF01586935</idno>
<idno type="ArticleID">Art13</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><creation><date>1988-08-19</date>
</creation>
<langUsage><language ident="en">en</language>
</langUsage>
<abstract xml:lang="en"><p>Abstract: A new conical algorithm is developed for finding the global minimum of a concave function over a polytope. To ensure faster convergence and overcome some major drawbacks of previous conical algorithms, a normal (rather than exhaustive) subdivision process is used.</p>
</abstract>
<textClass><keywords scheme="Journal Subject"><list><head>Mathematics</head>
<item><term>Mathematics of Computing</term>
</item>
<item><term>Numerical Analysis</term>
</item>
<item><term>Combinatorics</term>
</item>
<item><term>Calculus of Variations and Optimal Control</term>
</item>
<item><term>Optimization</term>
</item>
<item><term>Mathematical and Computational Physics</term>
</item>
<item><term>Mathematical Methods in Physics</term>
</item>
<item><term>Numerical and Computational Methods</term>
</item>
<item><term>Operation Research/Decision Theory</term>
</item>
</list>
</keywords>
</textClass>
</profileDesc>
<revisionDesc><change when="1988-08-19">Created</change>
<change when="1991-07-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/680AB0AF912957836C85C45D7294C1F0CA202820/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>10107</JournalID>
<JournalPrintISSN>0025-5610</JournalPrintISSN>
<JournalElectronicISSN>1436-4646</JournalElectronicISSN>
<JournalTitle>Mathematical Programming</JournalTitle>
<JournalAbbreviatedTitle>Mathematical Programming</JournalAbbreviatedTitle>
<JournalSubjectGroup><JournalSubject Type="Primary">Mathematics</JournalSubject>
<JournalSubject Type="Secondary">Mathematics of Computing</JournalSubject>
<JournalSubject Type="Secondary">Numerical Analysis</JournalSubject>
<JournalSubject Type="Secondary">Combinatorics</JournalSubject>
<JournalSubject Type="Secondary">Calculus of Variations and Optimal Control</JournalSubject>
<JournalSubject Type="Secondary">Optimization</JournalSubject>
<JournalSubject Type="Secondary">Mathematical and Computational Physics</JournalSubject>
<JournalSubject Type="Secondary">Mathematical Methods in Physics</JournalSubject>
<JournalSubject Type="Secondary">Numerical and Computational Methods</JournalSubject>
<JournalSubject Type="Secondary">Operation Research/Decision Theory</JournalSubject>
</JournalSubjectGroup>
</JournalInfo>
<Volume><VolumeInfo VolumeType="Regular" TocLevels="0"><VolumeIDStart>51</VolumeIDStart>
<VolumeIDEnd>51</VolumeIDEnd>
<VolumeIssueCount>3</VolumeIssueCount>
</VolumeInfo>
<Issue IssueType="Combined"><IssueInfo TocLevels="0"><IssueIDStart>1</IssueIDStart>
<IssueIDEnd>3</IssueIDEnd>
<IssueArticleCount>25</IssueArticleCount>
<IssueHistory><CoverDate><Year>1991</Year>
<Month>7</Month>
</CoverDate>
</IssueHistory>
<IssueCopyright><CopyrightHolderName>The Mathematical Programming Society, Inc.</CopyrightHolderName>
<CopyrightYear>1991</CopyrightYear>
</IssueCopyright>
</IssueInfo>
<Article ID="Art13"><ArticleInfo Language="En" ArticleType="OriginalPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ArticleID>BF01586935</ArticleID>
<ArticleDOI>10.1007/BF01586935</ArticleDOI>
<ArticleSequenceNumber>13</ArticleSequenceNumber>
<ArticleTitle Language="En">Normal conical algorithm for concave minimization over polytopes</ArticleTitle>
<ArticleFirstPage>229</ArticleFirstPage>
<ArticleLastPage>245</ArticleLastPage>
<ArticleHistory><RegistrationDate><Year>2005</Year>
<Month>4</Month>
<Day>14</Day>
</RegistrationDate>
<Received><Year>1988</Year>
<Month>8</Month>
<Day>19</Day>
</Received>
<Revised><Year>1989</Year>
<Month>6</Month>
<Day>12</Day>
</Revised>
</ArticleHistory>
<ArticleCopyright><CopyrightHolderName>The Mathematical Programming Society, Inc.</CopyrightHolderName>
<CopyrightYear>1991</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>10107</JournalID>
<VolumeIDStart>51</VolumeIDStart>
<VolumeIDEnd>51</VolumeIDEnd>
<IssueIDStart>1</IssueIDStart>
<IssueIDEnd>3</IssueIDEnd>
</ArticleContext>
</ArticleInfo>
<ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Hoang</GivenName>
<FamilyName>Tuy</FamilyName>
</AuthorName>
</Author>
<Affiliation ID="Aff1"><OrgName>Institute of Mathematics</OrgName>
<OrgAddress><Postbox>P.O. Box 631</Postbox>
<City>Bo Ho, Hanoi</City>
<Country>Vietnam</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>A new conical algorithm is developed for finding the global minimum of a concave function over a polytope. To ensure faster convergence and overcome some major drawbacks of previous conical algorithms, a normal (rather than exhaustive) subdivision process is used.</Para>
</Abstract>
<KeywordGroup Language="En"><Heading>Key words</Heading>
<Keyword>Concave minimization</Keyword>
<Keyword>conical algorithm</Keyword>
<Keyword>convergence condition</Keyword>
<Keyword>bisection</Keyword>
<Keyword>normal subdivision process</Keyword>
</KeywordGroup>
</ArticleHeader>
<NoBody></NoBody>
</Article>
</Issue>
</Volume>
</Journal>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Normal conical algorithm for concave minimization over polytopes</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA" lang="en"><title>Normal conical algorithm for concave minimization over polytopes</title>
</titleInfo>
<name type="personal"><namePart type="given">Hoang</namePart>
<namePart type="family">Tuy</namePart>
<affiliation>Institute of Mathematics, P.O. Box 631, Bo Ho, 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">1988-08-19</dateCreated>
<dateIssued encoding="w3cdtf">1991-07-01</dateIssued>
<copyrightDate encoding="w3cdtf">1991</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 new conical algorithm is developed for finding the global minimum of a concave function over a polytope. To ensure faster convergence and overcome some major drawbacks of previous conical algorithms, a normal (rather than exhaustive) subdivision process is used.</abstract>
<relatedItem type="host"><titleInfo><title>Mathematical Programming</title>
</titleInfo>
<titleInfo type="abbreviated"><title>Mathematical Programming</title>
</titleInfo>
<genre type="journal" displayLabel="Archive Journal"></genre>
<originInfo><dateIssued encoding="w3cdtf">1991-07-01</dateIssued>
<copyrightDate encoding="w3cdtf">1991</copyrightDate>
</originInfo>
<subject><genre>Mathematics</genre>
<topic>Mathematics of Computing</topic>
<topic>Numerical Analysis</topic>
<topic>Combinatorics</topic>
<topic>Calculus of Variations and Optimal Control</topic>
<topic>Optimization</topic>
<topic>Mathematical and Computational Physics</topic>
<topic>Mathematical Methods in Physics</topic>
<topic>Numerical and Computational Methods</topic>
<topic>Operation Research/Decision Theory</topic>
</subject>
<identifier type="ISSN">0025-5610</identifier>
<identifier type="eISSN">1436-4646</identifier>
<identifier type="JournalID">10107</identifier>
<identifier type="IssueArticleCount">25</identifier>
<identifier type="VolumeIssueCount">3</identifier>
<part><date>1991</date>
<detail type="volume"><number>51</number>
<caption>vol.</caption>
</detail>
<detail type="issue"><number>1-3</number>
<caption>no.</caption>
</detail>
<extent unit="pages"><start>229</start>
<end>245</end>
</extent>
</part>
<recordInfo><recordOrigin>The Mathematical Programming Society, Inc., 1991</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">680AB0AF912957836C85C45D7294C1F0CA202820</identifier>
<identifier type="DOI">10.1007/BF01586935</identifier>
<identifier type="ArticleID">BF01586935</identifier>
<identifier type="ArticleID">Art13</identifier>
<accessCondition type="use and reproduction" contentType="copyright">The Mathematical Programming Society, Inc., 1991</accessCondition>
<recordInfo><recordContentSource>SPRINGER</recordContentSource>
<recordOrigin>The Mathematical Programming Society, Inc., 1991</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 000E96 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000E96 | 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:680AB0AF912957836C85C45D7294C1F0CA202820
   |texte=   Normal conical algorithm for concave minimization over polytopes
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

	Serveur d'exploration sur l'Université de Trèves
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur l'Université de Trèves

Normal conical algorithm for concave minimization over polytopes

Normal conical algorithm for concave minimization over polytopes

Source :

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri