An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
From MaRDI portal
(Redirected from Publication:1107277)
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.
Recommendations
- A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems
- A simultaneous projections method for linear inequalities
- scientific article; zbMATH DE number 3991280
- Projection algorithms for linear programming
- An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
Cites work
- A Comparison of Some Methods for Solving Sparse Linear Least-Squares Problems
- A new polynomial-time algorithm for linear programming
- A primal-dual projection method for solving systems of linear inequalities
- A simultaneous projections method for linear inequalities
- An approach to nonlinear programming
- Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities
- Four dimensional x-projection method (with acceleration techniques) for solving systems of linear equations
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3499148 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- Large sparse numerical optimization
- Large-scale linearly constrained optimization
- Numerical Methods for Large Sparse Linear Least Squares Problems
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Solution of nonlinear systems of equations by an optimal projection method
- Solution of sparse linear least squares problems using Givens rotations
- Solution of underdetermined nonlinear equations by stationary iteration methods
- Solving systems of nonlinear equations by means of an accelerated successive orthogonal projections method
- The method of projections for finding the common point of convex sets
- The projection method for solving nonlinear systems of equations under the most violated constraint control
- The simplex method of linear programming using LU decomposition
Cited in
(6)- A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems
- Large-scale nonlinear programming algorithm using projection methods
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- How good are extrapolated bi-projection methods for linear feasibility problems?
- An acceleration scheme for Dykstra's algorithm
This page was built for publication: An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107277)
