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

DOI10.1016/0024-3795(95)00608-7MaRDI QIDQ676010zbMATHOpenAlexFDO

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

zbMATH Keywords

convex feasibility problemssystems of linear inequalitiesaccelerated relaxation methodsdeepest surrogate inequalitiesmonotone Gram matrices

Mathematics Subject Classification ID

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

Recommendations

• Publication:4035630
• Iterative method for solving the linear feasibility problem
• Publication:4233330
• Publication:4374365

Cites work

• scientific article; zbMATH DE number 996055 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3748409 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 194432 (Why is no real title available?)
• A simultaneous projections method for linear inequalities
• Block-iterative surrogate projection methods for convex feasibility problems
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• Feature Article—The Ellipsoid Method: A Survey
• Modifications and implementation of the ellipsoid algorithm for linear programming
• New iterative methods for linear inequalities
• On Projection Algorithms for Solving Convex Feasibility Problems
• On a relaxation method of solving systems of linear inequalities
• Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Strong convergence of projection-like methods in Hilbert spaces
• Surrogate methods for linear inequalities
• 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
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Solving Systems of Linear Inequalities

Cited in

(6)

• Projection methods for the linear split feasibility problems
• 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
• Nonnegative Moore--Penrose inverses of Gram operators
• On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints

Describes a project that uses

Uses Software

• LINPACK

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)