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

Similar Items