Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993
From MaRDI portal
Publication:1893613
DOI10.1007/BF02143923zbMath0819.00029OpenAlexW2002770211MaRDI QIDQ1893613
No author found.
Publication date: 10 August 1995
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02143923
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to numerical analysis (65-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Cites Work
- Optimal location on a sphere
- A globally convergent algorithm for facility location on a sphere
- A quadratically convergent method for minimizing a sum of euclidean norms
- A projected newton method forl p norm location problems
- Facility Location on a Sphere
- Weber's problem and weiszfeld's algorithm in general spaces
- Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
- On the Convergence of Miehle's Algorithm for the Euclidean Multifacility Location Problem
- Local convergence in Fermat's problem
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem
- Technical Note—Location Theory: A Selective Bibliography
- A note on Fermat's problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithms for constrained approximation and optimization. Proceedings of the workshop held in Stowe, VT, USA, May 23-26, 1993