Nearest q-flat to m points

Journal of Optimization Theory and Applications

Volumn 105, Issue 1, 2000, Pages 249-252

  Tseng, P ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Clustering; Eigenvalues; Eigenvectors; Nearest point

Indexed keywords

COMPUTATIONAL GEOMETRY;

CLUSTERINGS; EIGEN-VALUE; LEAST EIGENVALUE; LEAST SQUARE SENSE; NEAREST POINT; POSITIVE SEMIDEFINITE MATRICES; SYMMETRICS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 0034349278     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1004678431677     Document Type: Article

References (6)

1. 1. BRADLEY, P. S., and MANGASARIAN, O. L., k-Plane Clustering, Computer Sciences Report 9808, University of Wisconsin, Madison, Wisconsin, 1998; Journal of Global Optimization (to appear).
2. 1. BRADLEY, P. S., and MANGASARIAN, O. L., k-Plane Clustering, Computer Sciences Report 9808, University of Wisconsin, Madison, Wisconsin, 1998; Journal of Global Optimization (to appear).
3. 2. JAIN, A. K., and DUBES, R. C., Algorithms for Clustering Data, Prentice-Hall, Englewood Cliffs, New Jersey, 1988.
4. 3. SELIM, S. Z., and ISMAIL, M. A., K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality, IEEE Transactions on Pattern Analysis and Machine Intellience, Vol. 6, pp. 81-87, 1984.
5. 4. ROCKAFELLAR, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.
6. 5. HORN, R. A., and JOHNSON, C. R., Matrix Analysis, Cambridge University Press, Cambridge, United Kingdom, 1985.