Results 141 to 150 of about 6,104 (162)

Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem

SIAM Journal on Optimization, 1993
Summary: Convergence conditions are established for new sequential and parallel projected aggregation methods (PAMs) that find a feasible point of a large system of convex inequalities and linear equations. To formulate a multiprocessor method suitable for solving a nonstructured convex system, block iterative methods are used and all system ...
openaire   +1 more source

Subgradient Projection Algorithms and Approximate Solutions of Convex Feasibility Problems

Journal of Optimization Theory and Applications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A dynamical system method for solving the split convex feasibility problem

Journal of Industrial and Management Optimization, 2021
Ya-Ping Fang
exaly  

Inconsistent Convex Feasibility Problems

2023
openaire   +1 more source

Methods for Problems with Convex Feasible Set

2023
Luigi Grippo, Marco Sciandrone
openaire   +1 more source

A New Gradient Projection Algorithm for Convex Minimization Problem and its Application to Split Feasibility Problem

Vietnam Journal of Mathematics, 2021
MUZEYYEN Erturk
exaly  

Outer Approximation Methods for Solving Variational Inequalities Defined over the Solution Set of a Split Convex Feasibility Problem

Numerical Functional Analysis and Optimization, 2020
Andrzej Cegielski, Aviv Gibali, Simeon Reich   +2 more
exaly  

On the finite termination of the Douglas-Rachford method for the convex feasibility problem

Optimization, 2016
Shin-Ya Matsushita, Li Xu
exaly  

On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery

Optimization, 2018
Xiaopeng Zhao
exaly  

Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem

Optimization, 2014
Yazheng Dang, Yan Gao
exaly