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...
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
-
Estimating the Local Radius of Convergence for Picard Iteration
by: Ştefan Măruşter
Published: (2017-01-01) -
On the local convergence of the Modified Newton method
by: Măruşter Ştefan
Published: (2019-06-01) -
Local Convergence and Radius of Convergence for Modified Newton Method
by: Măruşter Ştefan
Published: (2017-12-01) -
Local convergence radius for the Mann-type iteration
by: Măruşter Ştefan
Published: (2015-12-01) -
Local Convergence of Exquerro-Hernandez Method
by: Măruşter Ştefan
Published: (2016-07-01)