Weiszfeld's method: old and new results

DOI10.1007/s10957-014-0586-7zbMath1316.49001OpenAlexW2109181422MaRDI QIDQ2260646

Shoham Sabach, Amir Beck

Publication date: 11 March 2015

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-014-0586-7

zbMATH Keywords

convergence propertiesgradient methodWeiszfeld's methodFermat-Weber problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02) Mathematical programming (educational aspects) (97N60)

Related Items

Estimating the geometric median in Hilbert spaces with stochastic gradient algorithms: \(L^p\) and almost sure rates of convergence, Generalized Krasnoselskii-Mann-type iterations for nonexpansive mappings in Hilbert spaces, Accelerated modified inertial Mann and viscosity algorithms to find a fixed point of \(\alpha\)-inverse strongly monotone operators, A PROBABILISTIC ℓ₁ METHOD FOR CLUSTERING HIGH-DIMENSIONAL DATA, On Newton's method for the Fermat-Weber location problem, Concentration study of M-estimators using the influence function, On the rotational invariant \(L_1\)-norm PCA, The optimal solution set of the multi-source Weber problem, Eigenvalue localization under partial spectral information, The generalized Fermat-Torricelli problem in Hilbert spaces, Simple approximative algorithms for free-support Wasserstein barycenters, On the geometric median of convex, triangular and other polygonal domains, Using the power of ideal solutions: simple proofs of some old and new results in location theory, On the robust PCA and Weiszfeld's algorithm, Proximal algorithms in statistics and machine learning, Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm, New convergence results for inertial Krasnoselskii-Mann iterations in Hilbert spaces with applications, Probabilistic smallest enclosing ball in high dimensions via subgradient sampling, Robust and Scalable Bayes via a Median of Subset Posterior Measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• The Fermat-Torricelli problem. I: A discrete gradient-method approach
• Solution of location problems with radial cost functions
• A note on the Weber location problem
• A least-squares-based method for a class of nonsmooth minimization problems with applications in plasticity
• A generalized Weiszfeld method for the multi-facility location problem
• A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
• On the point for which the sum of the distances to \(n\) given points is minimum
• Geometric methods and optimization problems
• On the convergence of the Weiszfeld algorithm
• Introductory lectures on convex optimization. A basic course.
• Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
• The Fermat-Weber location problem revisited
• Lectures on Modern Convex Optimization
• Smoothing and First Order Methods: A Unified Framework
• A quadratically convergent method for minimizing a sum of euclidean norms
• Iterative Minimization Schemes for Solving the Single Source Localization Problem
• Robust Regression Computation Using Iteratively Reweighted Least Squares
• Iteratively reweighted least squares minimization for sparse recovery
• A projected newton method forl p norm location problems
• The Euclidean Multifacility Location Problem
• Location-Allocation Problems
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• Local convergence in Fermat's problem
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• A note on accelerating the weiszfeld procedure
• An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms
• The Fitting of Power Series, Meaning Polynomials, Illustrated on Band-Spectroscopic Data
• Link-Length Minimization in Networks
• Nonlinear Programming
• Pioneering Developments in Location Analysis
• Proximité et dualité dans un espace hilbertien
• The Lawson Algorithm and Extensions
• A note on Fermat's problem
• Robust Statistics
• A modified Weiszfeld algorithm for the Fermat-Weber location problem