Finitely Convergent Iterative Methods with Overrelaxations Revisited

Finitely Convergent Iterative Methods with Overrelaxations Revisited

We study the finite convergence of iterative methods for solving convex feasibility problems. Our key assumptions are that the interior of the solution set is nonempty and that certain overrelaxation parameters converge to zero, but with a rate slower than any geometric sequence. Unlike other works...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Kolobov, Victor I, Reich, Simeon, Zalas, Rafał
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Optimization and Control
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Kolobov, Victor I
Reich, Simeon
Zalas, Rafał
description We study the finite convergence of iterative methods for solving convex feasibility problems. Our key assumptions are that the interior of the solution set is nonempty and that certain overrelaxation parameters converge to zero, but with a rate slower than any geometric sequence. Unlike other works in this area, which require divergent series of overrelaxations, our approach allows us to consider some summable series. By employing quasi-Fej\'{e}rian analysis in the latter case, we obtain additional asymptotic convergence guarantees, even when the interior of the solution set is empty.
doi_str_mv 10.48550/arxiv.2102.00471
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2102_00471</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2102_00471</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-d7b0f10a82d679f65fea4f22fab1b758f617f0402a8e0ca71b9ae8e25071344c3</originalsourceid><addsrcrecordid>eNotj0FOwzAQRb1hgQoHYIUvkDDj2LG7rAKFSkWVUPfRpBlTS2mCHCu0tycUVn_x9J_0hHhAyLUzBp4onsOUKwSVA2iLt-J5HfqQuLvIaugnjp_cJ7lJHCmFieU7p-PQjvI7pKPczTxyR-eZDf0oP3gK43xu78SNp27k-_9diP36ZV-9Zdvd66ZabTMqLWatbcAjkFNtaZe-NJ5Je6U8NdhY43yJ1oMGRY7hQBabJbFjZcBiofWhWIjHP-01o_6K4UTxUv_m1Nec4gf2WEYi</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Finitely Convergent Iterative Methods with Overrelaxations Revisited</title><source>arXiv.org</source><creator>Kolobov, Victor I ; Reich, Simeon ; Zalas, Rafał</creator><creatorcontrib>Kolobov, Victor I ; Reich, Simeon ; Zalas, Rafał</creatorcontrib><description>We study the finite convergence of iterative methods for solving convex feasibility problems. Our key assumptions are that the interior of the solution set is nonempty and that certain overrelaxation parameters converge to zero, but with a rate slower than any geometric sequence. Unlike other works in this area, which require divergent series of overrelaxations, our approach allows us to consider some summable series. By employing quasi-Fej\'{e}rian analysis in the latter case, we obtain additional asymptotic convergence guarantees, even when the interior of the solution set is empty.</description><identifier>DOI: 10.48550/arxiv.2102.00471</identifier><language>eng</language><subject>Mathematics - Optimization and Control</subject><creationdate>2021-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2102.00471$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2102.00471$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Kolobov, Victor I</creatorcontrib><creatorcontrib>Reich, Simeon</creatorcontrib><creatorcontrib>Zalas, Rafał</creatorcontrib><title>Finitely Convergent Iterative Methods with Overrelaxations Revisited</title><description>We study the finite convergence of iterative methods for solving convex feasibility problems. Our key assumptions are that the interior of the solution set is nonempty and that certain overrelaxation parameters converge to zero, but with a rate slower than any geometric sequence. Unlike other works in this area, which require divergent series of overrelaxations, our approach allows us to consider some summable series. By employing quasi-Fej\'{e}rian analysis in the latter case, we obtain additional asymptotic convergence guarantees, even when the interior of the solution set is empty.</description><subject>Mathematics - Optimization and Control</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj0FOwzAQRb1hgQoHYIUvkDDj2LG7rAKFSkWVUPfRpBlTS2mCHCu0tycUVn_x9J_0hHhAyLUzBp4onsOUKwSVA2iLt-J5HfqQuLvIaugnjp_cJ7lJHCmFieU7p-PQjvI7pKPczTxyR-eZDf0oP3gK43xu78SNp27k-_9diP36ZV-9Zdvd66ZabTMqLWatbcAjkFNtaZe-NJ5Je6U8NdhY43yJ1oMGRY7hQBabJbFjZcBiofWhWIjHP-01o_6K4UTxUv_m1Nec4gf2WEYi</recordid><startdate>20210131</startdate><enddate>20210131</enddate><creator>Kolobov, Victor I</creator><creator>Reich, Simeon</creator><creator>Zalas, Rafał</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20210131</creationdate><title>Finitely Convergent Iterative Methods with Overrelaxations Revisited</title><author>Kolobov, Victor I ; Reich, Simeon ; Zalas, Rafał</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-d7b0f10a82d679f65fea4f22fab1b758f617f0402a8e0ca71b9ae8e25071344c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Mathematics - Optimization and Control</topic><toplevel>online_resources</toplevel><creatorcontrib>Kolobov, Victor I</creatorcontrib><creatorcontrib>Reich, Simeon</creatorcontrib><creatorcontrib>Zalas, Rafał</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kolobov, Victor I</au><au>Reich, Simeon</au><au>Zalas, Rafał</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Finitely Convergent Iterative Methods with Overrelaxations Revisited</atitle><date>2021-01-31</date><risdate>2021</risdate><abstract>We study the finite convergence of iterative methods for solving convex feasibility problems. Our key assumptions are that the interior of the solution set is nonempty and that certain overrelaxation parameters converge to zero, but with a rate slower than any geometric sequence. Unlike other works in this area, which require divergent series of overrelaxations, our approach allows us to consider some summable series. By employing quasi-Fej\'{e}rian analysis in the latter case, we obtain additional asymptotic convergence guarantees, even when the interior of the solution set is empty.</abstract><doi>10.48550/arxiv.2102.00471</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2102.00471
ispartof
issn
language eng
recordid cdi_arxiv_primary_2102_00471
source arXiv.org
subjects Mathematics - Optimization and Control
title Finitely Convergent Iterative Methods with Overrelaxations Revisited
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T18%3A11%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Finitely%20Convergent%20Iterative%20Methods%20with%20Overrelaxations%20Revisited&rft.au=Kolobov,%20Victor%20I&rft.date=2021-01-31&rft_id=info:doi/10.48550/arxiv.2102.00471&rft_dat=%3Carxiv_GOX%3E2102_00471%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true