On the Convex Feasibility Problem

On the Convex Feasibility Problem

The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a family depending of the two characteristics: the emptiness...

Full description

Bibliographic Details
Main Authors: Laura Măruşter, Ştefan Măruşter
Format: Article
Language:deu
Published: Mirton Publishing House, Timisoara 2009-01-01
Series:Anale: Seria Informatică
Online Access:http://anale-informatica.tibiscus.ro/download/lucrari/7-1-24-Maruster.pdf
id doaj-5a0a34cf76cf41519f3b8dcfbe028d6e
record_format Article
spelling doaj-5a0a34cf76cf41519f3b8dcfbe028d6e2020-11-24T22:21:24ZdeuMirton Publishing House, TimisoaraAnale: Seria Informatică1583-71652065-74712009-01-01VII1225238On the Convex Feasibility ProblemLaura MăruşterŞtefan MăruşterThe convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a family depending of the two characteristics: the emptiness and boudedness of the intersection of the family. The case four (the interior of the intersection is empty and the intersection itself is bounded) is unsolved. In this paper we give a (partial) answer for the case four: in the case of two closed convex sets in ℝ3 the regularity property holds.http://anale-informatica.tibiscus.ro/download/lucrari/7-1-24-Maruster.pdf
collection DOAJ
language deu
format Article
sources DOAJ
author Laura Măruşter
Ştefan Măruşter
spellingShingle Laura Măruşter
Ştefan Măruşter
On the Convex Feasibility Problem
Anale: Seria Informatică
author_facet Laura Măruşter
Ştefan Măruşter
author_sort Laura Măruşter
title On the Convex Feasibility Problem
title_short On the Convex Feasibility Problem
title_full On the Convex Feasibility Problem
title_fullStr On the Convex Feasibility Problem
title_full_unstemmed On the Convex Feasibility Problem
title_sort on the convex feasibility problem
publisher Mirton Publishing House, Timisoara
series Anale: Seria Informatică
issn 1583-7165
2065-7471
publishDate 2009-01-01
description The convergence of the projection algorithm for solving the convex feasibility problem for a family of closed convex sets, is in connection with the regularity properties of the family. In the paper [18] are pointed out four cases of such a family depending of the two characteristics: the emptiness and boudedness of the intersection of the family. The case four (the interior of the intersection is empty and the intersection itself is bounded) is unsolved. In this paper we give a (partial) answer for the case four: in the case of two closed convex sets in ℝ3 the regularity property holds.
url http://anale-informatica.tibiscus.ro/download/lucrari/7-1-24-Maruster.pdf
work_keys_str_mv AT lauramaruster ontheconvexfeasibilityproblem
AT stefanmaruster ontheconvexfeasibilityproblem
_version_ 1725771301435473920

Similar Items