On the robust PCA and Weiszfeld's algorithm (Q2019909)

From MaRDI portal

Revision as of 19:09, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On the robust PCA and Weiszfeld's algorithm	scientific article

Statements

scholarly article

0 references

On the robust PCA and Weiszfeld's algorithm (English)

0 references

Sebastian Neumayer

0 references

0 references

0 references

Gabriele Drauschke

0 references

Applied Mathematics and Optimization

0 references

publication date

22 April 2021

0 references

full work available at URL

https://arxiv.org/abs/1902.04292

0 references

zbMATH Keywords

robust principal component analysis

0 references

robust subspace recovery

0 references

Weiszfeld algorithm

0 references

Kurdyka-Lojasiewicz property

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

Weiszfeld's method: old and new results

0 references

Technical note: Directional derivatives in nonsmooth optimization

0 references

Robust principal component analysis?

0 references

A Majorize–Minimize Strategy for Subspace Optimization Applied to Image Restoration

0 references

Projection algorithms for nonconvex minimization with application to sparse principal component analysis

0 references

The elements of statistical learning. Data mining, inference, and prediction

0 references

Robust Statistics

0 references

Robust Statistics

0 references

Principal component analysis for Riemannian manifolds, with an application to triangular shape spaces

0 references

Local convergence in Fermat's problem

0 references

Robust \(\ell_1\) approaches to computing the geometric median and principal and independent components

0 references

A note on Fermat's problem

0 references

On gradients of functions definable in o-minimal structures

0 references

Fast, robust and non-convex subspace recovery

0 references

Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization

0 references

\(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers

0 references

Robust computation of linear models by convex relaxation

0 references

Projection-Pursuit Approach to Robust Dispersion Matrices and Principal Components: Primary Theory and Monte Carlo

0 references

0 references

Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint

0 references

Optimal Algorithms for <formula formulatype="inline"> <tex Notation="TeX">$L_{1}$</tex></formula>-subspace Signal Processing

0 references

Efficient L1-Norm Principal-Component Analysis via Bit Flipping

0 references

Robust Statistics

0 references

A Well-Tempered Landscape for Non-convex Robust Subspace Recovery

0 references

Two proposals for robust PCA using semidefinite programming

0 references

Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming

0 references

Scale space and variational methods in computer vision. 6th international conference, SSVM 2017, Kolding, Denmark, June 4--8, 2017. Proceedings

0 references

On the rotational invariant \(L_1\)-norm PCA

0 references

On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem

0 references

Barycentric subspace analysis on manifolds

0 references

Sample-limited \(L_p\) barycentric subspace analysis on constant curvature spaces

0 references

Convex Analysis

0 references

0 references

On vector and matrix median computation

0 references

Optimization over geodesics for exact principal geodesic analysis

0 references

A modified Weiszfeld algorithm for the Fermat-Weber location problem

0 references

Robust PCA via Outlier Pursuit

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S00245-019-09566-1

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2019909

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2019909&oldid=38835197"