An efficient parallel scheme for minimizing a sum of Euclidean norms

DOI10.1016/0024-3795(89)90692-7zbMath0677.65061OpenAlexW2031694155MaRDI QIDQ1123548

Robert J. Plemmons, Stephen J. Wright

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(89)90692-7

zbMATH Keywords

algorithmNewton's methodparallel computationline searchNumerical examplesminimizing a sum of Euclidean normsQR decompositionsvector multiprocessor system

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Parallel numerical computation (65Y05)

Related Items

Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999, Dedication to Robert J. Plemmons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average linear least squares regression
• Linear convergence of generalized Weiszfeld's method
• A quadratically convergent method for minimizing a sum of euclidean norms
• The WY Representation for Products of Householder Matrices
• A projected newton method forl p norm location problems
• Weber's problem and weiszfeld's algorithm in general spaces
• Numerical Solution of the Minimal Surface Equation