An interior points algorithm for the convex feasibility problem
From MaRDI portal
Publication:1166775
DOI10.1016/0196-8858(83)90019-2zbMath0489.52005OpenAlexW1973701131MaRDI QIDQ1166775
Ron Aharoni, Abraham Berman, Yair Censor
Publication date: 1983
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-8858(83)90019-2
Related Items (12)
Opial-Type Theorems and the Common Fixed Point Problem ⋮ Dual averaging with adaptive random projection for solving evolving distributed optimization problems ⋮ Block-iterative surrogate projection methods for convex feasibility problems ⋮ On some optimization techniques in image reconstruction from projections ⋮ Projection methods for the linear split feasibility problems ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization ⋮ An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ A superlinearly convergent projection algorithm for solving the convex inequality problem ⋮ Block-iterative projection methods for parallel computation of solutions to convex feasibility problems ⋮ Cyclic subgradient projections
Cites Work
- Unnamed Item
- Unnamed Item
- Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Cyclic subgradient projections
- Convex Analysis
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
This page was built for publication: An interior points algorithm for the convex feasibility problem
