A parallel subgradient projections method for the convex feasibility problem
From MaRDI portal
Publication:1091948
DOI10.1016/0377-0427(87)90004-5zbMath0623.90076OpenAlexW1989820267MaRDI QIDQ1091948
Publication date: 1987
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(87)90004-5
parallel processingnonlinear inequalitiesconvex feasibility problemacceleration procedureparallel subgradient projection
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations, Opial-Type Theorems and the Common Fixed Point Problem, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, A non-interior continuation algorithm for solving the convex feasibility problem, Block-iterative surrogate projection methods for convex feasibility problems, Distributed solutions for loosely coupled feasibility problems using proximal splitting methods, AIR tools II: algebraic iterative reconstruction methods, improved implementation, A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators, Superiorization with level control, Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment, An acceleration scheme for cyclic subgradient projections method, A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints, AIR tools -- a MATLAB package of algebraic iterative reconstruction methods, Enhancement of the Kaczmarz algorithm with projection adjustment, Extrapolation and local acceleration of an iterative process for common fixed point problems, Convex feasibility modeling and projection methods for sparse signal recovery, Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour, Linear convergence rates for extrapolated fixed point algorithms, Iterative algorithm for solving a class of convex feasibility problem, Convergence analysis of a parallel projection algorithm for solving convex feasibility problems, Non-monotonous sequential subgradient projection algorithm for convex feasibility problem, Cyclic and simultaneous iterative methods to matrix equations of the form \(A_iXB_i=F_i\), Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures, Extrapolation algorithm for affine-convex feasibility problems, The Averaged Kaczmarz Iteration for Solving Inverse Problems, An acceleration scheme for Dykstra's algorithm, Acceleration schemes for the method of alternating projections, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Convergence of string-averaging method for a class of operators, Algorithms for the quasiconvex feasibility problem, Parallel projection methods and the resolution of ill-posed problems
Uses Software
Cites Work
- Unnamed Item
- Solving systems of nonlinear equations by means of an accelerated successive orthogonal projections method
- Parallel algorithms for solving systems of nonlinear equations
- New methods for linear inequalities
- Four dimensional x-projection method (with acceleration techniques) for solving systems of linear equations
- Testing Unconstrained Optimization Software
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- The method of projections for finding the common point of convex sets
