Incomplete oblique projections for solving large inconsistent linear systems
DOI10.1007/S10107-006-0066-4zbMATH Open1344.65046OpenAlexW1991057740MaRDI QIDQ2467156FDOQ2467156
Authors: M. T. Guardarucci, M. C. Vacchino, H. Scolnik, N. Echebest 
Publication date: 21 January 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0066-4
Recommendations
- An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
- Extensions of incomplete oblique projections method for solving rank-deficient least-squares problems
- Incomplete alternating projection method for large inconsistent linear systems
- On the incomplete oblique projections method for solving box constrained least squares problems
- Projections and preconditioning for inconsistent least-squares problems
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Iterative oblique projection onto convex sets and the split feasibility problem
- Title not available (Why is that?)
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization
- An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
- On certain iterative methods for solving linear systems
- Acceleration scheme for parallel projected aggregation methods for solving large linear systems
- A class of optimized row projection methods for solving large nonsymmetric linear systems
- New optimized and accelerated PAM methods for solving large non-symmetric linear systems: Theory and practice
Cited In (12)
- Generalized projections onto convex sets
- Projections and preconditioning for inconsistent least-squares problems
- Incomplete alternating projection method for large inconsistent linear systems
- An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
- Implicit regularization of the incomplete oblique projections method
- On the incomplete oblique projections method for solving box constrained least squares problems
- Extensions of incomplete oblique projections method for solving rank-deficient least-squares problems
- A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming
- Incomplete oblique projections method for solving regularized least‐squares problems in image reconstruction
- Projection onto simplicial cones by a semi-smooth Newton method
- Projection onto simplicial cones by Picard's method
- An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
Uses Software
This page was built for publication: Incomplete oblique projections for solving large inconsistent linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467156)
