An efficient parallel scheme for minimizing a sum of Euclidean norms
DOI10.1016/0024-3795(89)90692-7zbMATH Open0677.65061OpenAlexW2031694155MaRDI QIDQ1123548FDOQ1123548
Authors: 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
Recommendations
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- A primal-dual algorithm for minimizing a sum of Euclidean norms
- An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
- An Efficient Algorithm for Minimizing a Sum of p-Norms
- Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms
- A quadratically convergent method for minimizing a sum of euclidean norms
- A parallel descent algorithm for convex programming
- A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints
- A quadratically convergent method for minimizing a sum of Euclidean norms with linear constraints
algorithmparallel computationline searchNewton's methodNumerical examplesminimizing a sum of Euclidean normsQR decompositionsvector multiprocessor system
Numerical mathematical programming methods (65K05) Convex programming (90C25) Parallel numerical computation (65Y05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A quadratically convergent method for minimizing a sum of euclidean norms
- Title not available (Why is that?)
- A projected newton method forl p norm location problems
- Weber's problem and weiszfeld's algorithm in general spaces
- The WY Representation for Products of Householder Matrices
- Numerical Solution of the Minimal Surface Equation
- Title not available (Why is that?)
- Linear convergence of generalized Weiszfeld's method
- Average linear least squares regression
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
- Remark on Algorithm 539
- A quadratically convergent method for minimizing a sum of euclidean norms
- A Newton acceleration of the Weiszfeld algorithm for minimizing the sum of Euclidean distances
- A quadratically convergent method for minimizing a sum of Euclidean norms with linear constraints
- On the optimality conditions for the problem of minimizing a sum of euclidean norms
- Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999
- Title not available (Why is that?)
- Dedication to Robert J. Plemmons
This page was built for publication: An efficient parallel scheme for minimizing a sum of Euclidean norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123548)
