An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
type: Item
instance of: scholarly article
title: An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
zbMATH Open document ID: 0652.65048
DOI: 10.1016/0898-1221(88)90158-7
publication date: 1988-01-01T00:00:00Z
review text: A method for solving systems of linear equations and inequalities closely related to sequential projection methods is proposed. For computing the projection on linear manifolds defined by equations the author uses the LL T-factorization. The results of a numerical experiment with the large- scale problem are presented. On the basis of the proposed method a scheme to handle general linear programming problems is suggested.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 4064383
zbMATH Keywords: linear feasibility problem
zbMATH Keywords: Cholesky factorization
zbMATH Keywords: linear inequalities methods
zbMATH Keywords: sequential projection methods
zbMATH Keywords: linear manifolds
zbMATH Keywords: large-scale problem
author: J. M. Martínez
reviewed by: V. S. Izhutkin
describes a project that uses: MINOS
MaRDI profile type: Publication
full work available at URL: 0898-1221(88)90158-7
OpenAlex ID: W2090324300
cites work: Q4739659
cites work: An approach to nonlinear programming
cites work: The simplex method of linear programming using LU decomposition
cites work: Q3844775
cites work: Q5580053
cites work: Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
cites work: A simultaneous projections method for linear inequalities
cites work: Q3325518
cites work: A primal-dual projection method for solving systems of linear inequalities
cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications
cites work: Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities
cites work: The projection method for solving nonlinear systems of equations under the ''most violated constraint'' control
cites work: Solution of nonlinear systems of equations by an optimal projection method
cites work: Solving systems of nonlinear equations by means of an accelerated successive orthogonal projections method
cites work: Solution of underdetermined nonlinear equations by stationary iteration methods
cites work: Four dimensional x-projection method (with acceleration techniques) for solving systems of linear equations
cites work: Large sparse numerical optimization
cites work: Solution of sparse linear least squares problems using Givens rotations
cites work: A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
cites work: Numerical Methods for Large Sparse Linear Least Squares Problems
cites work: A new polynomial-time algorithm for linear programming
cites work: The method of projections for finding the common point of convex sets
cites work: Q4080639
cites work: Large-scale linearly constrained optimization
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 4064383