An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems

DOI10.1016/0898-1221(88)90158-7zbMath0652.65048OpenAlexW2090324300MaRDI QIDQ1107277

José Mario Martínez

Publication date: 1988

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(88)90158-7

zbMATH Keywords

Cholesky factorizationlarge-scale problemlinear feasibility problemlinear manifoldslinear inequalities methodssequential projection methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06)

Related Items

A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems, An acceleration scheme for Dykstra's algorithm

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Large sparse numerical optimization
• A simultaneous projections method for linear inequalities
• A primal-dual projection method for solving systems of linear inequalities
• The projection method for solving nonlinear systems of equations under the most violated constraint control
• Solution of nonlinear systems of equations by an optimal projection method
• Solving systems of nonlinear equations by means of an accelerated successive orthogonal projections method
• Solution of sparse linear least squares problems using Givens rotations
• Four dimensional x-projection method (with acceleration techniques) for solving systems of linear equations
• Solution of underdetermined nonlinear equations by stationary iteration methods
• Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities
• An approach to nonlinear programming
• A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
• Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
• Numerical Methods for Large Sparse Linear Least Squares Problems
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Large-scale linearly constrained optimization
• The simplex method of linear programming using LU decomposition
• The method of projections for finding the common point of convex sets