Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems

DOI10.1016/0024-3795(95)00608-7zbMath0870.65046OpenAlexW1967518292MaRDI QIDQ676010

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

zbMATH Keywords

systems of linear inequalitiesconvex feasibility problemsaccelerated relaxation methodsdeepest surrogate inequalitiesmonotone Gram matrices

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

Nonnegative Moore--Penrose inverses of Gram operators ⋮ Projection methods for the linear split feasibility problems ⋮ 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 ⋮ Residual Selection in A Projection Method for Convex Minimization Problems

Uses Software

• LINPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simultaneous projections method for linear inequalities
• Strong convergence of projection-like methods in Hilbert spaces
• New iterative methods for linear inequalities
• Surrogate methods for linear inequalities
• Block-iterative surrogate projection methods for convex feasibility problems
• The Relaxation Method for Solving Systems of Linear Inequalities
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Feature Article—The Ellipsoid Method: A Survey
• Modifications and implementation of the ellipsoid algorithm for linear programming
• Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
• On Projection Algorithms for Solving Convex Feasibility Problems
• 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
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• On a relaxation method of solving systems of linear inequalities
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities