The Convex Feasibility Problem and Mann-type Iteration

Abstract

The algorithms for solving convex feasibility problems receive great attention for their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences, (for example: computerized tomography). Usually, the convex feasibility problems are solved by projection algorithms. The projection method is a particular case of the Mann iteration process. Numerical examples are given.

Authors and Affiliations

Irina Maria Terfaloaga

Keywords

Related Articles

Numerical Study of Shear Stress Around an Ideal Roughness

In EHD lubrication conditions the viscosity of the lubricants increases, occuring at high shear rates of plastic behavior. Previous researches showed that the shear stress in the film thickness of the lubricant may vary,...

Simple and Multi-collision of an Ellipsoid with Planar Surfaces. Part II: Example

This paper is a complementary one for our previous paper [25]. The collision of the ellipsoid is considered to take place with the main planes of the reference system. In our simulation we obtain the following results: n...

Power System Health Monitoring Based on Energy Losses using Genetic Algorithm

System health assessment becomes ever more important as consumers take for granted the apparent infallible character of power supply and the extremely high costs of prolonged down times. A system that achieves minimum op...

Current State of Research at the EMAD Research Centre from „Ştefan cel Mare“ University in Connection with Actuators and Solar Motors with Solid Heating Medium

Within the EMAD Research Center of the USV have been developed since 1996 a number of solutions in heliothermic actuators and motors area made on the basis of solid heating medium. The solutions relates to rotary actuato...

Equilibrium without Friction of a Particle on a Mobile Surface with Bilateral Constraints

In this paper we will study the equilibrium of a particle on a mobile surface in the case characterized by bilateral constraints between the particle and the surface, and the absence of friction. Based on our previous wo...

Download PDF file
  • EP ID EP446526
  • DOI -
  • Views 125
  • Downloads 0

How To Cite

Irina Maria Terfaloaga (2017). The Convex Feasibility Problem and Mann-type Iteration. Analele Universitatii "Eftimie Murgu" Resita. Fascicula de Inginerie, 24(1), 402-410. https://europub.co.uk/articles/-A-446526