Additional information
| Author(s) | Mărușter, Laura, Mărușter, Ștefan |
|---|
On convex feasibility problems
In this paper we consider a projection method for convex feasibility problem that is known to converge only weakly. Exploiting a property concerning the intersection of a family of convex closed sets, we present a condition that makes them strongly convergent, without additional assumptions.
Related products
Recently posted
-
Approximate Solutions for Multi-Objective Optimization Problems via Scalarizing and Nonscalarizing Methods
-
A product of strongly quasi-nonexpansive mappings in Hadamard spaces
-
Inertial viscosity fixed point algorithms for monotone inclusion, convex minimization, and image restoration problems
-
Holderian Stability for Parametric Optimization Models and Applications
-
A Novel Fixed-Point Based Two-Step Inertial Algorithm for Convex Bilevel Optimization in Deep Learning Data Classification
-
Double-step inertial algorithms for equilibrium and fixed point problems in Hilbert spaces
-
Accelerated forward-backward algorithm based on inertial and correction terms with linesearch for solving convex minimization problem and its application
-
A Dual-Projective Double Inertial Forward-Backward Splitting Algorithm for Variational Inclusion Problems with Applications to External Validation in Breast Cancer Diagnosis
-
Efficient Large-Scale Classification with Linex Least Square Twin Bounded Support Vector Machine
-
Classifying compressive strength of clay bricks using an inertial projected forward-backward algorithm