IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v105y2000i1d10.1023_a1004678431677.html
   My bibliography  Save this article

Nearest q-Flat to m Points

Author

Listed:
  • P. Tseng

    (University of Washington)

Abstract

Recently, Bradley and Mangasarian studied the problem of finding the nearest plane to m given points in ℝn in the least square sense. They showed that the problem reduces to finding the least eigenvalue and associated eigenvector of a certain n×n symmetric positive-semidefinite matrix. We extend this result to the general problem of finding the nearest q-flat to m points, with 0≤q≤n−1.

Suggested Citation

  • P. Tseng, 2000. "Nearest q-Flat to m Points," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 249-252, April.
  • Handle: RePEc:spr:joptap:v:105:y:2000:i:1:d:10.1023_a:1004678431677
    DOI: 10.1023/A:1004678431677
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1004678431677
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1004678431677?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Majid Noroozi & Marianna Pensky, 2022. "The Hierarchy of Block Models," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 84(1), pages 64-107, June.
    2. Wentao Qu & Xianchao Xiu & Huangyue Chen & Lingchen Kong, 2023. "A Survey on High-Dimensional Subspace Clustering," Mathematics, MDPI, vol. 11(2), pages 1-39, January.
    3. Renli Liang & Yanqin Bai & Hai Xiang Lin, 2019. "An inexact splitting method for the subspace segmentation from incomplete and noisy observations," Journal of Global Optimization, Springer, vol. 73(2), pages 411-429, February.
    4. Yuan-Hai Shao & Nai-Yang Deng, 2015. "The Equivalence Between Principal Component Analysis and Nearest Flat in the Least Square Sense," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 278-284, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:105:y:2000:i:1:d:10.1023_a:1004678431677. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.