A projection method for least-squares solutions to overdetermined systems of linear inequalities
From MaRDI portal
Publication:1821512
DOI10.1016/0024-3795(87)90296-5zbMath0616.65064OpenAlexW2071213012MaRDI QIDQ1821512
Publication date: 1987
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(87)90296-5
linear inequalitiesprimal-dual algorithmlinear convergence rateoverdetermined systemsinconsistent systemsleast-squares solutions
Related Items (17)
Block-iterative surrogate projection methods for convex feasibility problems ⋮ Monotone operator theory in convex optimization ⋮ A parallel projection method for solving generalized linear least-squares problems ⋮ Unrestricted iterations of nonexpansive mappings in Hilbert space ⋮ Finding best approximation pairs relative to two closed convex sets in Hilbert spaces ⋮ Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry ⋮ A primal-dual method of partial inverses for composite inclusions ⋮ Random Products of Contractions in Banach Spaces ⋮ On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators ⋮ Products of conditional expectation operators: convergence and divergence ⋮ The Douglas-Rachford algorithm in the affine-convex case ⋮ Unrestricted iterations of nonexpansive mappings in Banach spaces ⋮ The geometry of monotone operator splitting methods ⋮ The cluster set of a nonexpansive mapping ⋮ A primal-dual projection method for solving systems of linear inequalities ⋮ Applications of the method of partial inverses to convex programming: Decomposition ⋮ On the unrestricted iteration of projections in Hilbert space
Cites Work
- Partial inverse of a monotone operator
- Block-iterative methods for consistent and inconsistent linear equations
- On the maximal domain of a monotone function
- A primal-dual projection method for solving systems of linear inequalities
- Monotone (nonlinear) operators in Hilbert space
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Projection method for solving a singular system of linear equations and its applications
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- The Relaxation Method for Solving Systems of Linear Inequalities
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- On the non-polynomiality of the relaxation method for systems of linear inequalities
- Monotone Operators and the Proximal Point Algorithm
- Relaxation methods for image reconstruction
- On convergence rates of subgradient optimization methods
- Proximité et dualité dans un espace hilbertien
- A Lipschitzian Characterization of Convex Polyhedra
- Functional Operators (AM-22), Volume 2
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A projection method for least-squares solutions to overdetermined systems of linear inequalities