Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
Identifieur interne : 001078 ( Istex/Corpus ); précédent : 001077; suivant : 001079Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
Auteurs : R. Horst ; N. V. ThoaiSource :
- Journal of Optimization Theory and Applications [ 0022-3239 ] ; 1992-09-01.
Abstract
Abstract: In this paper, we are concerned with the linearly constrained global minimization of the sum of a concave function defined on ap-dimensional space and a linear function defined on aq-dimensional space, whereq may be much larger thanp. It is shown that a conical algorithm can be applied in a space of dimensionp + 1 that involves only linear programming subproblems in a space of dimensionp +q + 1. Some computational results are given.
Url:
DOI: 10.1007/BF00940322
Links to Exploration step
ISTEX:02150DD38CA9D589EB9F54098492762BC2636EEFLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems</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, 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>Institute of Mathematics, Hanoi, Vietnam</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:02150DD38CA9D589EB9F54098492762BC2636EEF</idno><date when="1992" year="1992">1992</date><idno type="doi">10.1007/BF00940322</idno><idno type="url">https://api.istex.fr/document/02150DD38CA9D589EB9F54098492762BC2636EEF/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001078</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001078</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems</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, 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>Institute of Mathematics, Hanoi, Vietnam</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Optimization Theory and Applications</title><title level="j" type="abbrev">J Optim Theory Appl</title><idno type="ISSN">0022-3239</idno><idno type="eISSN">1573-2878</idno><imprint><publisher>Kluwer Academic Publishers-Plenum Publishers</publisher><pubPlace>New York</pubPlace><date type="published" when="1992-09-01">1992-09-01</date><biblScope unit="volume">74</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="469">469</biblScope><biblScope unit="page" to="486">486</biblScope></imprint><idno type="ISSN">0022-3239</idno></series><idno type="istex">02150DD38CA9D589EB9F54098492762BC2636EEF</idno><idno type="DOI">10.1007/BF00940322</idno><idno type="ArticleID">BF00940322</idno><idno type="ArticleID">Art6</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0022-3239</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this paper, we are concerned with the linearly constrained global minimization of the sum of a concave function defined on ap-dimensional space and a linear function defined on aq-dimensional space, whereq may be much larger thanp. It is shown that a conical algorithm can be applied in a space of dimensionp + 1 that involves only linear programming subproblems in a space of dimensionp +q + 1. Some computational results are given.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>R. Horst</name><affiliations><json:string>Fachbereich IV-Mathematik, University of Trier, Trier, Germany</json:string></affiliations></json:item><json:item><name>N. V. Thoai</name><affiliations><json:string>Institute of Mathematics, Hanoi, Vietnam</json:string></affiliations></json:item></author><articleId><json:string>BF00940322</json:string><json:string>Art6</json:string></articleId><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: In this paper, we are concerned with the linearly constrained global minimization of the sum of a concave function defined on ap-dimensional space and a linear function defined on aq-dimensional space, whereq may be much larger thanp. It is shown that a conical algorithm can be applied in a space of dimensionp + 1 that involves only linear programming subproblems in a space of dimensionp +q + 1. Some computational results are given.</abstract><qualityIndicators><score>5.888</score><pdfVersion>1.3</pdfVersion><pdfPageSize>432 x 648 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>446</abstractCharCount><pdfWordCount>5612</pdfWordCount><pdfCharCount>26346</pdfCharCount><pdfPageCount>18</pdfPageCount><abstractWordCount>74</abstractWordCount></qualityIndicators><title>Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems</title><refBibs><json:item><host><author><json:item><name>Horst </name></json:item><json:item><name>R Tuy</name></json:item><json:item><name>H </name></json:item></author><title>Global Optimization: Deterministic Approaches</title><publicationDate>1990</publicationDate></host></json:item><json:item><author><json:item><name>Horst </name></json:item><json:item><name>R </name></json:item></author><host><volume>6</volume><pages><last>205</last><first>195</first></pages><author></author><title>Operations Research Spectrum</title><publicationDate>1984</publicationDate></host><title>On the Global Minimization of a Concave Function: Introduction and Survey</title><publicationDate>1984</publicationDate></json:item><json:item><author><json:item><name>Pardalos </name></json:item><json:item><name>P,M </name></json:item><json:item><name>Rosen </name></json:item><json:item><name>J,B </name></json:item></author><host><author></author><title>Constrained Global Optimization</title><publicationDate>1987</publicationDate></host><publicationDate>1987</publicationDate></json:item><json:item><host><author><json:item><name>Rosen </name></json:item><json:item><name>J,B </name></json:item></author><title>~ Parametric Global Minimization for Large-Scale Problems</title><publicationDate>1983</publicationDate></host></json:item><json:item><author><json:item><name>Rosen </name></json:item><json:item><name>J,B </name></json:item><json:item><name>Pardalos </name></json:item><json:item><name>P,M </name></json:item></author><host><volume>34</volume><pages><last>174</last><first>163</first></pages><author></author><title>Mathematical Programming</title><publicationDate>1986</publicationDate></host><title>Global Minimization of Large-Scale Constrained Concave Quadratic Problems by Separable Programming</title><publicationDate>1986</publicationDate></json:item><json:item><host><author><json:item><name>Kalantari </name></json:item><json:item><name>B Large</name></json:item></author><title>Scale Global Minimization of Linearly Constrained Quadratic Functions and Related Problems</title><publicationDate>1984</publicationDate></host></json:item><json:item><author><json:item><name>Kalantari </name></json:item><json:item><name>B </name></json:item><json:item><name>Rosen </name></json:item><json:item><name>J,B </name></json:item></author><host><volume>12</volume><pages><last>561</last><first>544</first></pages><author></author><title>Mathematics of Operations Research</title><publicationDate>1987</publicationDate></host><title>Algorithm for Large-Scale Global Minimization of Linearly Constrained Concave Quadratic Functions</title><publicationDate>1987</publicationDate></json:item><json:item><host><pages><last>352</last><first>335</first></pages><author><json:item><name>H Tuy</name></json:item></author><title>Concave Minimization under Linear Constraints with Special Structure, Optimization</title><publicationDate>1985</publicationDate></host></json:item><json:item><host><author><json:item><name>Rockafellar </name></json:item><json:item><name>R,T </name></json:item></author><title>Convex Analysis</title><publicationDate>1970</publicationDate></host></json:item><json:item><author><json:item><name>H Tuy</name></json:item></author><host><volume>30</volume><pages><last>182</last><first>150</first></pages><author></author><title>Mathematical Programming Study</title><publicationDate>1987</publicationDate></host><title>Global Minimization of a Difference of Two Convex Functions</title><publicationDate>1987</publicationDate></json:item><json:item><author><json:item><name>H Tuy</name></json:item></author><host><volume>5</volume><pages><last>1440</last><first>1437</first></pages><author></author><title>Soviet Mathematics Doklady</title><publicationDate>1964</publicationDate></host><title>Concave Programming under Linear Constraints</title><publicationDate>1964</publicationDate></json:item><json:item><author><json:item><name>Hamami </name></json:item><json:item><name>M </name></json:item><json:item><name>Jacobson </name></json:item><json:item><name>S,E </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 Conical Processes for Concave Minimization on Convex Polytopes</title><publicationDate>1988</publicationDate></json:item><json:item><author><json:item><name>Thoai </name></json:item><json:item><name>N,V Tuy</name></json:item><json:item><name>H </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 Algorithms for Minimizing a Concave Function</title><publicationDate>1980</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>Thai </name></json:item><json:item><name>N,Q </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>Horst </name></json:item><json:item><name>R </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>Horst </name></json:item><json:item><name>R Thoai</name></json:item><json:item><name>N,V </name></json:item><json:item><name>Benson </name></json:item><json:item><name>H </name></json:item></author><host><volume>50</volume><pages><last>274</last><first>259</first></pages><author></author><title>Mathematical Programming</title><publicationDate>1991</publicationDate></host><title>Concave Minimization via Conical Partitions and Polyhedral Outer Approximation</title><publicationDate>1991</publicationDate></json:item><json:item><host><pages><last>289</last><first>271</first></pages><author><json:item><name>Horst </name></json:item><json:item><name>R </name></json:item><json:item><name>Thoai </name></json:item><json:item><name>N,V </name></json:item></author><title>Modification, Implementation, and Comparison of Three Algorithms for Globally Solving Linearly Constrained Concave Minimization Problems, Computing</title><publicationDate>1989</publicationDate></host></json:item><json:item><author><json:item><name>Tuy </name></json:item><json:item><name>H </name></json:item></author><host><pages><last>245</last><first>229</first></pages><author></author><title>Mathematical Programming</title><publicationDate>1991</publicationDate></host><title>Normal Conical Algorithm for Concave Minimization over Polytopes</title><publicationDate>1991</publicationDate></json:item><json:item><author><json:item><name>Horst </name></json:item><json:item><name>R Tuy</name></json:item><json:item><name>H </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 GlobaI Methods in Multiextremal Optimization</title><publicationDate>1987</publicationDate></json:item><json:item><host><pages><last>807</last><first>791</first></pages><author><json:item><name>H Tuy</name></json:item><json:item><name>V Khatchaturov</name></json:item><json:item><name>Utkin </name></json:item><json:item><name>S </name></json:item></author><title>A Class of Exhaustive Cone Splitting Procedures in Conical Algorithms for Concave Minimization, Optimization</title><publicationDate>1987</publicationDate></host></json:item></refBibs><genre><json:string>research-article</json:string></genre><host><volume>74</volume><pages><last>486</last><first>469</first></pages><issn><json:string>0022-3239</json:string></issn><issue>3</issue><subject><json:item><value>Theory of Computation</value></json:item><json:item><value>Applications of Mathematics</value></json:item><json:item><value>Optimization</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>Engineering, general</value></json:item><json:item><value>Operation Research/Decision Theory</value></json:item></subject><journalId><json:string>10957</json:string></journalId><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1573-2878</json:string></eissn><title>Journal of Optimization Theory and Applications</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/BF00940322</json:string></doi><id>02150DD38CA9D589EB9F54098492762BC2636EEF</id><score>1.3446095</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/02150DD38CA9D589EB9F54098492762BC2636EEF/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/02150DD38CA9D589EB9F54098492762BC2636EEF/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/02150DD38CA9D589EB9F54098492762BC2636EEF/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems</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-Plenum Publishers</publisher><pubPlace>New York</pubPlace><availability><p>Plenum Publishing Corporation, 1992</p></availability><date>1992</date></publicationStmt><notesStmt><note>Contributed Papers</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems</title><author xml:id="author-1"><persName><forename type="first">R.</forename><surname>Horst</surname></persName><note type="biography">Professor</note><affiliation>Professor</affiliation><affiliation>Fachbereich IV-Mathematik, University of Trier, Trier, Germany</affiliation></author><author xml:id="author-2"><persName><forename type="first">N.</forename><surname>Thoai</surname></persName><note type="biography">Professon</note><affiliation>Professon</affiliation><affiliation>Institute of Mathematics, Hanoi, Vietnam</affiliation></author></analytic><monogr><title level="j">Journal of Optimization Theory and Applications</title><title level="j" type="abbrev">J Optim Theory Appl</title><idno type="journal-ID">10957</idno><idno type="pISSN">0022-3239</idno><idno type="eISSN">1573-2878</idno><idno type="issue-article-count">16</idno><idno type="volume-issue-count">3</idno><imprint><publisher>Kluwer Academic Publishers-Plenum Publishers</publisher><pubPlace>New York</pubPlace><date type="published" when="1992-09-01"></date><biblScope unit="volume">74</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="469">469</biblScope><biblScope unit="page" to="486">486</biblScope></imprint></monogr><idno type="istex">02150DD38CA9D589EB9F54098492762BC2636EEF</idno><idno type="DOI">10.1007/BF00940322</idno><idno type="ArticleID">BF00940322</idno><idno type="ArticleID">Art6</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1992</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: In this paper, we are concerned with the linearly constrained global minimization of the sum of a concave function defined on ap-dimensional space and a linear function defined on aq-dimensional space, whereq may be much larger thanp. It is shown that a conical algorithm can be applied in a space of dimensionp + 1 that involves only linear programming subproblems in a space of dimensionp +q + 1. Some computational results are given.</p></abstract><textClass><keywords scheme="Journal Subject"><list><head>Mathematics</head><item><term>Theory of Computation</term></item><item><term>Applications of Mathematics</term></item><item><term>Optimization</term></item><item><term>Calculus of Variations and Optimal Control</term></item><item><term>Optimization</term></item><item><term>Engineering, general</term></item><item><term>Operation Research/Decision Theory</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1992-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/02150DD38CA9D589EB9F54098492762BC2636EEF/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-Plenum Publishers</PublisherName><PublisherLocation>New York</PublisherLocation></PublisherInfo><Journal><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="Unnumbered"><JournalID>10957</JournalID><JournalPrintISSN>0022-3239</JournalPrintISSN><JournalElectronicISSN>1573-2878</JournalElectronicISSN><JournalTitle>Journal of Optimization Theory and Applications</JournalTitle><JournalAbbreviatedTitle>J Optim Theory Appl</JournalAbbreviatedTitle><JournalSubjectGroup><JournalSubject Type="Primary">Mathematics</JournalSubject><JournalSubject Type="Secondary">Theory of Computation</JournalSubject><JournalSubject Type="Secondary">Applications of Mathematics</JournalSubject><JournalSubject Type="Secondary">Optimization</JournalSubject><JournalSubject Type="Secondary">Calculus of Variations and Optimal Control</JournalSubject><JournalSubject Type="Secondary">Optimization</JournalSubject><JournalSubject Type="Secondary">Engineering, general</JournalSubject><JournalSubject Type="Secondary">Operation Research/Decision Theory</JournalSubject></JournalSubjectGroup></JournalInfo><Volume><VolumeInfo VolumeType="Regular" TocLevels="0"><VolumeIDStart>74</VolumeIDStart><VolumeIDEnd>74</VolumeIDEnd><VolumeIssueCount>3</VolumeIssueCount></VolumeInfo><Issue IssueType="Regular"><IssueInfo TocLevels="0"><IssueIDStart>3</IssueIDStart><IssueIDEnd>3</IssueIDEnd><IssueArticleCount>16</IssueArticleCount><IssueHistory><CoverDate><Year>1992</Year><Month>9</Month></CoverDate></IssueHistory><IssueCopyright><CopyrightHolderName>Plenum Publishing Corporation</CopyrightHolderName><CopyrightYear>1992</CopyrightYear></IssueCopyright></IssueInfo><Article ID="Art6"><ArticleInfo Language="En" ArticleType="OriginalPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ArticleID>BF00940322</ArticleID><ArticleDOI>10.1007/BF00940322</ArticleDOI><ArticleSequenceNumber>6</ArticleSequenceNumber><ArticleTitle Language="En">Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems</ArticleTitle><ArticleCategory>Contributed Papers</ArticleCategory><ArticleFirstPage>469</ArticleFirstPage><ArticleLastPage>486</ArticleLastPage><ArticleHistory><RegistrationDate><Year>2004</Year><Month>12</Month><Day>20</Day></RegistrationDate></ArticleHistory><ArticleCopyright><CopyrightHolderName>Plenum Publishing Corporation</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>10957</JournalID><VolumeIDStart>74</VolumeIDStart><VolumeIDEnd>74</VolumeIDEnd><IssueIDStart>3</IssueIDStart><IssueIDEnd>3</IssueIDEnd></ArticleContext></ArticleInfo><ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>R.</GivenName><FamilyName>Horst</FamilyName></AuthorName><Role>Professor</Role></Author><Author AffiliationIDS="Aff2"><AuthorName DisplayOrder="Western"><GivenName>N.</GivenName><GivenName>V.</GivenName><FamilyName>Thoai</FamilyName></AuthorName><Role>Professon</Role></Author><Affiliation ID="Aff1"><OrgDivision>Fachbereich IV-Mathematik</OrgDivision><OrgName>University of Trier</OrgName><OrgAddress><City>Trier</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Institute of Mathematics</OrgName><OrgAddress><City>Hanoi</City><Country>Vietnam</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>In this paper, we are concerned with the linearly constrained global minimization of the sum of a concave function defined on a<Emphasis Type="Italic">p</Emphasis>-dimensional space and a linear function defined on a<Emphasis Type="Italic">q</Emphasis>-dimensional space, where<Emphasis Type="Italic">q</Emphasis> may be much larger than<Emphasis Type="Italic">p</Emphasis>. It is shown that a conical algorithm can be applied in a space of dimension<Emphasis Type="Italic">p</Emphasis> + 1 that involves only linear programming subproblems in a space of dimension<Emphasis Type="Italic">p</Emphasis> +<Emphasis Type="Italic">q</Emphasis> + 1. Some computational results are given.</Para></Abstract><KeywordGroup Language="En"><Heading>Key Words</Heading><Keyword>Global optimization</Keyword><Keyword>concave minimization</Keyword><Keyword>conical algorithms</Keyword><Keyword>branch-and-bound methods</Keyword><Keyword>decomposition</Keyword></KeywordGroup><ArticleNote Type="CommunicatedBy"><SimplePara>Communicated by M. Avriel</SimplePara></ArticleNote><ArticleNote Type="Misc"><SimplePara>This research was accomplished while the second author was a Fellow of the Alexander von Humboldt Foundation, University of Trier, Trier, Germany.</SimplePara></ArticleNote></ArticleHeader><NoBody></NoBody></Article></Issue></Volume></Journal></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems</title></titleInfo><name type="personal"><namePart type="given">R.</namePart><namePart type="family">Horst</namePart><affiliation>Fachbereich IV-Mathematik, University of Trier, Trier, Germany</affiliation><role><roleTerm type="text">author</roleTerm></role><description>Professor</description></name><name type="personal"><namePart type="given">N.</namePart><namePart type="given">V.</namePart><namePart type="family">Thoai</namePart><affiliation>Institute of Mathematics, Hanoi, Vietnam</affiliation><role><roleTerm type="text">author</roleTerm></role><description>Professon</description></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper"></genre><originInfo><publisher>Kluwer Academic Publishers-Plenum Publishers</publisher><place><placeTerm type="text">New York</placeTerm></place><dateIssued encoding="w3cdtf">1992-09-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: In this paper, we are concerned with the linearly constrained global minimization of the sum of a concave function defined on ap-dimensional space and a linear function defined on aq-dimensional space, whereq may be much larger thanp. It is shown that a conical algorithm can be applied in a space of dimensionp + 1 that involves only linear programming subproblems in a space of dimensionp +q + 1. Some computational results are given.</abstract><note>Contributed Papers</note><relatedItem type="host"><titleInfo><title>Journal of Optimization Theory and Applications</title></titleInfo><titleInfo type="abbreviated"><title>J Optim Theory Appl</title></titleInfo><genre type="journal" displayLabel="Archive Journal"></genre><originInfo><dateIssued encoding="w3cdtf">1992-09-01</dateIssued><copyrightDate encoding="w3cdtf">1992</copyrightDate></originInfo><subject><genre>Mathematics</genre><topic>Theory of Computation</topic><topic>Applications of Mathematics</topic><topic>Optimization</topic><topic>Calculus of Variations and Optimal Control</topic><topic>Optimization</topic><topic>Engineering, general</topic><topic>Operation Research/Decision Theory</topic></subject><identifier type="ISSN">0022-3239</identifier><identifier type="eISSN">1573-2878</identifier><identifier type="JournalID">10957</identifier><identifier type="IssueArticleCount">16</identifier><identifier type="VolumeIssueCount">3</identifier><part><date>1992</date><detail type="volume"><number>74</number><caption>vol.</caption></detail><detail type="issue"><number>3</number><caption>no.</caption></detail><extent unit="pages"><start>469</start><end>486</end></extent></part><recordInfo><recordOrigin>Plenum Publishing Corporation, 1992</recordOrigin></recordInfo></relatedItem><identifier type="istex">02150DD38CA9D589EB9F54098492762BC2636EEF</identifier><identifier type="DOI">10.1007/BF00940322</identifier><identifier type="ArticleID">BF00940322</identifier><identifier type="ArticleID">Art6</identifier><accessCondition type="use and reproduction" contentType="copyright">Plenum Publishing Corporation, 1992</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Plenum Publishing Corporation, 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 001078 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001078 | 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:02150DD38CA9D589EB9F54098492762BC2636EEF
|texte= Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
}}
| This area was generated with Dilib version V0.6.31. |  |