Convergence of algorithms for perturbed optimization problems
Identifieur interne : 003012 ( Main/Exploration ); précédent : 003011; suivant : 003013Convergence of algorithms for perturbed optimization problems
Auteurs : Ekkehard W. Sachs [Allemagne]Source :
- Annals of Operations Research [ 0254-5330 ] ; 1990-12-01.
Abstract
Abstract: Infinite-dimensional optimization problems occur in various applications such as optimal control problems and parameter identification problems. If these problems are solved numerically the methods require a discretization which can be viewed as a perturbation of the data of the optimization problem. In this case the expected convergence behavior of the numerical method used to solve the problem does not only depend on the discretized problem but also on the original one. Algorithms which are analyzed include the gradient projection method, conditional gradient method, Newton's method and quasi-Newton methods for unconstrained and constrained problems with simple constraints.
Url:
DOI: 10.1007/BF02055200
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001188
- to stream Istex, to step Curation: 001076
- to stream Istex, to step Checkpoint: 001567
- to stream Main, to step Merge: 003618
- to stream Main, to step Curation: 003012
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Convergence of algorithms for perturbed optimization problems</title><author><name sortKey="Sachs, Ekkehard W" sort="Sachs, Ekkehard W" uniqKey="Sachs E" first="Ekkehard W." last="Sachs">Ekkehard W. Sachs</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F10280A81B4F593EA7F1B81403DC2C1BBAE59897</idno><date when="1990" year="1990">1990</date><idno type="doi">10.1007/BF02055200</idno><idno type="url">https://api.istex.fr/document/F10280A81B4F593EA7F1B81403DC2C1BBAE59897/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001188</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001188</idno><idno type="wicri:Area/Istex/Curation">001076</idno><idno type="wicri:Area/Istex/Checkpoint">001567</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001567</idno><idno type="wicri:doubleKey">0254-5330:1990:Sachs E:convergence:of:algorithms</idno><idno type="wicri:Area/Main/Merge">003618</idno><idno type="wicri:Area/Main/Curation">003012</idno><idno type="wicri:Area/Main/Exploration">003012</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Convergence of algorithms for perturbed optimization problems</title><author><name sortKey="Sachs, Ekkehard W" sort="Sachs, Ekkehard W" uniqKey="Sachs E" first="Ekkehard W." last="Sachs">Ekkehard W. Sachs</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV-Mathematik, Universität Trier, Postfach 3825, D-5500, Trier</wicri:regionArea><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Annals of Operations Research</title><title level="j" type="abbrev">Ann Oper Res</title><idno type="ISSN">0254-5330</idno><idno type="eISSN">1572-9338</idno><imprint><publisher>Baltzer Science Publishers, Baarn/Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="1990-12-01">1990-12-01</date><biblScope unit="volume">27</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="311">311</biblScope><biblScope unit="page" to="341">341</biblScope></imprint><idno type="ISSN">0254-5330</idno></series><idno type="istex">F10280A81B4F593EA7F1B81403DC2C1BBAE59897</idno><idno type="DOI">10.1007/BF02055200</idno><idno type="ArticleID">BF02055200</idno><idno type="ArticleID">Art14</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0254-5330</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Infinite-dimensional optimization problems occur in various applications such as optimal control problems and parameter identification problems. If these problems are solved numerically the methods require a discretization which can be viewed as a perturbation of the data of the optimization problem. In this case the expected convergence behavior of the numerical method used to solve the problem does not only depend on the discretized problem but also on the original one. Algorithms which are analyzed include the gradient projection method, conditional gradient method, Newton's method and quasi-Newton methods for unconstrained and constrained problems with simple constraints.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Sachs, Ekkehard W" sort="Sachs, Ekkehard W" uniqKey="Sachs E" first="Ekkehard W." last="Sachs">Ekkehard W. Sachs</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003012 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003012 | 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= Exploration
|type= RBID
|clé= ISTEX:F10280A81B4F593EA7F1B81403DC2C1BBAE59897
|texte= Convergence of algorithms for perturbed optimization problems
}}
| This area was generated with Dilib version V0.6.31. |  |