Projection algorithms for linear programming
Identifieur interne : 002D23 ( Main/Curation ); précédent : 002D22; suivant : 002D24Projection algorithms for linear programming
Auteurs : U. Betke [Allemagne] ; P. Gritzmann [Allemagne]Source :
- European Journal of Operational Research [ 0377-2217 ] ; 1992.
Abstract
Based on the nearest-point projection of geometric convexity we give a general projection approach for solving the feasibility problem of linear programming. Application of Shor's method of space dilation gives rise to a family of polynomial-time ellipsoidal algorithms with improved termination criteria in case of infeasibility. Moreover, the approach renders possible application of various techniques from nonlinear programming. In particular, using a variable metric algorithm with exact line search we obtain a fast and practically well-behaving algorithm for linear programming.
Url:
DOI: 10.1016/0377-2217(92)90080-S
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001100
- to stream Istex, to step Curation: Pour aller vers cette notice dans l'étape Curation :000F89
- to stream Istex, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :001369
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :003300
Links to Exploration step
ISTEX:6FE9317EF4EAD706B992EBF43CB0DA5558B022BCLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Projection algorithms for linear programming</title>
<author><name sortKey="Betke, U" sort="Betke, U" uniqKey="Betke U" first="U." last="Betke">U. Betke</name>
</author>
<author><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:6FE9317EF4EAD706B992EBF43CB0DA5558B022BC</idno>
<date when="1992" year="1992">1992</date>
<idno type="doi">10.1016/0377-2217(92)90080-S</idno>
<idno type="url">https://api.istex.fr/document/6FE9317EF4EAD706B992EBF43CB0DA5558B022BC/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001100</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001100</idno>
<idno type="wicri:Area/Istex/Curation">000F89</idno>
<idno type="wicri:Area/Istex/Checkpoint">001369</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001369</idno>
<idno type="wicri:doubleKey">0377-2217:1992:Betke U:projection:algorithms:for</idno>
<idno type="wicri:Area/Main/Merge">003300</idno>
<idno type="wicri:Area/Main/Curation">002D23</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a">Projection algorithms for linear programming</title>
<author><name sortKey="Betke, U" sort="Betke, U" uniqKey="Betke U" first="U." last="Betke">U. Betke</name>
<affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Universität Siegen, Fachbereich Mathematik, Hölderlinstr. 3, D-5900 Siegen</wicri:regionArea>
<wicri:noRegion>D-5900 Siegen</wicri:noRegion>
<wicri:noRegion>D-5900 Siegen</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Gritzmann, P" sort="Gritzmann, P" uniqKey="Gritzmann P" first="P." last="Gritzmann">P. Gritzmann</name>
<affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Universität Trier, Fb IV, Mathematik, D-5500 Trier</wicri:regionArea>
<wicri:noRegion>D-5500 Trier</wicri:noRegion>
<wicri:noRegion>D-5500 Trier</wicri:noRegion>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="j">European Journal of Operational Research</title>
<title level="j" type="abbrev">EOR</title>
<idno type="ISSN">0377-2217</idno>
<imprint><publisher>ELSEVIER</publisher>
<date type="published" when="1992">1992</date>
<biblScope unit="volume">60</biblScope>
<biblScope unit="issue">3</biblScope>
<biblScope unit="page" from="287">287</biblScope>
<biblScope unit="page" to="295">295</biblScope>
</imprint>
<idno type="ISSN">0377-2217</idno>
</series>
<idno type="istex">6FE9317EF4EAD706B992EBF43CB0DA5558B022BC</idno>
<idno type="DOI">10.1016/0377-2217(92)90080-S</idno>
<idno type="PII">0377-2217(92)90080-S</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0377-2217</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Based on the nearest-point projection of geometric convexity we give a general projection approach for solving the feasibility problem of linear programming. Application of Shor's method of space dilation gives rise to a family of polynomial-time ellipsoidal algorithms with improved termination criteria in case of infeasibility. Moreover, the approach renders possible application of various techniques from nonlinear programming. In particular, using a variable metric algorithm with exact line search we obtain a fast and practically well-behaving algorithm for linear programming.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002D23 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 002D23 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= Main |étape= Curation |type= RBID |clé= ISTEX:6FE9317EF4EAD706B992EBF43CB0DA5558B022BC |texte= Projection algorithms for linear programming }}
This area was generated with Dilib version V0.6.31. |