Pages that link to "Item:Q2260646"

The following pages link to Weiszfeld's method: old and new results (Q2260646):

Displaying 17 items.

• Estimating the geometric median in Hilbert spaces with stochastic gradient algorithms: \(L^p\) and almost sure rates of convergence (Q268758) (← links)
• On Newton's method for the Fermat-Weber location problem (Q306303) (← links)
• On the geometric median of convex, triangular and other polygonal domains (Q1717123) (← links)
• Proximal algorithms in statistics and machine learning (Q1790304) (← links)
• On the robust PCA and Weiszfeld's algorithm (Q2019909) (← links)
• Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm (Q2036201) (← links)
• New convergence results for inertial Krasnoselskii-Mann iterations in Hilbert spaces with applications (Q2038623) (← links)
• Accelerated modified inertial Mann and viscosity algorithms to find a fixed point of \(\alpha\)-inverse strongly monotone operators (Q2130919) (← links)
• Concentration study of M-estimators using the influence function (Q2154967) (← links)
• On the rotational invariant \(L_1\)-norm PCA (Q2174418) (← links)
• Using the power of ideal solutions: simple proofs of some old and new results in location theory (Q2240676) (← links)
• Generalized Krasnoselskii-Mann-type iterations for nonexpansive mappings in Hilbert spaces (Q2364129) (← links)
• The optimal solution set of the multi-source Weber problem (Q2414188) (← links)
• Eigenvalue localization under partial spectral information (Q2419033) (← links)
• The generalized Fermat-Torricelli problem in Hilbert spaces (Q2679558) (← links)
• Simple approximative algorithms for free-support Wasserstein barycenters (Q2701424) (← links)
• Probabilistic smallest enclosing ball in high dimensions via subgradient sampling (Q5088979) (← links)