Monotone gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
- 1 February 1997
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 252 (1-3) , 27-33
- https://doi.org/10.1016/0024-3795(95)00608-7
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On Projection Algorithms for Solving Convex Feasibility ProblemsSIAM Review, 1996
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and ExtensionsSIAM Journal on Control and Optimization, 1996
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level MethodsSIAM Journal on Control and Optimization, 1996
- Block-iterative surrogate projection methods for convex feasibility problemsLinear Algebra and its Applications, 1995
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility ProblemSIAM Journal on Optimization, 1993
- Surrogate methods for linear inequalitiesJournal of Optimization Theory and Applications, 1992
- A simultaneous projections method for linear inequalitiesLinear Algebra and its Applications, 1985
- Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSIAM Review, 1981
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954