Nearest \(q\)-flat to \(m\) points

DOI10.1023/A:1004678431677zbMath0971.90055MaRDI QIDQ1579644

Paul Tseng

Publication date: 14 September 2000

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

zbMATH Keywords

clusteringeigenvalueseigenvectorsnearest point

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items (16)

The hierarchy of block models ⋮ An inexact splitting method for the subspace segmentation from incomplete and noisy observations ⋮ Unnamed Item ⋮ Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms ⋮ Double graphs regularized multi-view subspace clustering ⋮ A geometric analysis of subspace clustering with outliers ⋮ Hybrid linear modeling via local best-fit flats ⋮ A new approach to two-view motion segmentation using global dimension minimization ⋮ Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization ⋮ The equivalence between principal component analysis and nearest flat in the least square sense ⋮ Unnamed Item ⋮ Robust subspace clustering ⋮ Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering ⋮ Similarity matrix framework for data from union of subspaces ⋮ Foundations of a multi-way spectral clustering framework for hybrid linear modeling ⋮ Filtrated Algebraic Subspace Clustering

Cites Work

• Unnamed Item
• \(k\)-plane clustering
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• Matrix Analysis
• Convex Analysis

This page was built for publication: Nearest \(q\)-flat to \(m\) points