A parallel projection method for solving generalized linear least-squares problems

DOI10.1007/BF01404463zbMath0659.65043OpenAlexW2028837780MaRDI QIDQ1112561

Shih-Ping Han, Gang Lou

Publication date: 1988

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133275

zbMATH Keywords

convergenceparallel algorithmsblock partitioningparallel projection methodconvex polyhedral conegeneralized linear least-squares problems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Convex programming (90C25) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partial inverse of a monotone operator
• Block-iterative methods for consistent and inconsistent linear equations
• A primal-dual projection method for solving systems of linear inequalities
• New methods for linear inequalities
• A projection method for least-squares solutions to overdetermined systems of linear inequalities
• Optimization and nonsmooth analysis
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• A Gauss-Newton Approach to Solving Generalized Inequalities
• A Parallel Algorithm for a Class of Convex Programs
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• On the Successive Projections Approach to Least-Squares Problems
• Convex Analysis

This page was built for publication: A parallel projection method for solving generalized linear least-squares problems