Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
DOI10.1016/0024-3795(95)00608-7zbMATH Open0870.65046OpenAlexW1967518292MaRDI QIDQ676010FDOQ676010
Authors: Krzysztof C. Kiwiel 
Publication date: 17 September 1997
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(95)00608-7
Recommendations
convex feasibility problemssystems of linear inequalitiesaccelerated relaxation methodsdeepest surrogate inequalitiesmonotone Gram matrices
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Feature Article—The Ellipsoid Method: A Survey
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- Strong convergence of projection-like methods in Hilbert spaces
- On a relaxation method of solving systems of linear inequalities
- The Relaxation Method for Solving Systems of Linear Inequalities
- Block-iterative surrogate projection methods for convex feasibility problems
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
- A simultaneous projections method for linear inequalities
- Modifications and implementation of the ellipsoid algorithm for linear programming
- New iterative methods for linear inequalities
- Surrogate methods for linear inequalities
Cited In (6)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Reflection-projection method for convex feasibility problems with an obtuse cone
- Obtuse cones and Gram matrices with non-negative inverse
- Nonnegative Moore--Penrose inverses of Gram operators
- Projection methods for the linear split feasibility problems
- Residual Selection in A Projection Method for Convex Minimization Problems
Uses Software
This page was built for publication: Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676010)
