An efficient parallel scheme for minimizing a sum of Euclidean norms
From MaRDI portal
Publication:1123548
DOI10.1016/0024-3795(89)90692-7zbMath0677.65061MaRDI QIDQ1123548
Stephen J. Wright, Robert J. Plemmons
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
algorithm; Newton's method; parallel computation; line search; Numerical examples; minimizing a sum of Euclidean norms; QR decompositions; vector multiprocessor system
65K05: Numerical mathematical programming methods
90C25: Convex programming
65Y05: Parallel numerical computation
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
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item