A parallel subgradient projections method for the convex feasibility problem
From MaRDI portal
Publication:1091948
DOI10.1016/0377-0427(87)90004-5zbMath0623.90076MaRDI 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 processing; nonlinear inequalities; convex feasibility problem; acceleration procedure; parallel subgradient projection
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C30: Nonlinear programming
90C55: Methods of successive quadratic programming type
Related Items
Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem, 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 Dykstra's algorithm, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, Extrapolation and local acceleration of an iterative process for common fixed point problems, Convex feasibility modeling and projection methods for sparse signal recovery, Convergence analysis of a parallel projection algorithm for solving convex feasibility problems, Non-monotonous sequential subgradient projection algorithm for convex feasibility problem, Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations, Acceleration schemes for the method of alternating projections, Parallel projection methods and the resolution of ill-posed problems, Block-iterative surrogate projection methods for convex feasibility problems, An acceleration scheme for cyclic subgradient projections method, Cyclic and simultaneous iterative methods to matrix equations of the form \(A_iXB_i=F_i\), Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures, AIR tools -- a MATLAB package of algebraic iterative reconstruction methods, Extrapolation algorithm for affine-convex feasibility problems, Algorithms for the quasiconvex feasibility problem, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, Convergence of string-averaging method for a class of operators, Opial-Type Theorems and the Common Fixed Point Problem, Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
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
