An efficient parallel scheme for minimizing a sum of Euclidean norms
From MaRDI portal
(Redirected from Publication:1123548)
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
Cites work
- scientific article; zbMATH DE number 3936253 (Why is no real title available?)
- scientific article; zbMATH DE number 3763164 (Why is no real title available?)
- scientific article; zbMATH DE number 3489960 (Why is no real title available?)
- scientific article; zbMATH DE number 3584869 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A projected newton method forl p norm location problems
- A quadratically convergent method for minimizing a sum of euclidean norms
- Average linear least squares regression
- Linear convergence of generalized Weiszfeld's method
- Numerical Solution of the Minimal Surface Equation
- The WY Representation for Products of Householder Matrices
- Weber's problem and weiszfeld's algorithm in general spaces
Cited in
(9)- scientific article; zbMATH DE number 3972075 (Why is no real title available?)
- Dedication to Robert J. Plemmons
- On the optimality conditions for the problem of minimizing a sum of euclidean norms
- An Efficient Primal-Dual Interior-Point 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
- Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999
- Remark on Algorithm 539
- A quadratically convergent method for minimizing a sum of euclidean norms
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)