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

Case Study Regarding the Design of a Direct Current Electromagnet for the MIG Welding of Metallic Materials Part I: Description of the Welding Methods and Preliminary Calculus of the Electromagnet

The paper refers to the design of a direct current electromagnet, located on the head of a swan neck welding gun of a MIG welding equipment and used for magnetising the rotation space of two additional electric arches, i...

Design and Control of the Electric Drive of the Anti-Hail Launching System

In the present, the Romanian anti-hail launchers are manually oper-ated. This means that the positioning of the launcher on the two direc-tions (azimuth and elevation) are adjusted based on the commands, by the human ope...

The Convex Feasibility Problem and Mann-type Iteration

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: co...

The Importance of Optimal Design in Outdoor Light Source Positioning

In this work we underline the importance of the optimal design for out-door light systems such that light posts and sources are placed correctly. We present a case study where we considered a city road section equipped w...

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 123
  • 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://www.europub.co.uk/articles/-A-446526