IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v33y2016i04ns0217595916500238.html
   My bibliography  Save this article

On Low Rank Approximation of Linear Operators in p-Norms and Some Algorithms

Author

Listed:
  • Yang Liu

    (Department of Mathematics, Michigan State University, East Lansing, MI 48824, USA)

Abstract

In this paper, we study the optimal or best approximation of any linear operator by low rank linear operators, especially, any linear operator on the ℓp-space, p ∈ [1,∞), under ℓp norm, or in Minkowski distance. Considering generalized singular values and using techniques from differential geometry, we extend the classical Schmidt–Mirsky theorem in the direction of the ℓp-norm of linear operators for some p values. Also, we develop and provide algorithms for finding the solution to the low rank approximation problems in some nontrivial scenarios. The results can be applied to, in particular, matrix completion and sparse matrix recovery.

Suggested Citation

  • Yang Liu, 2016. "On Low Rank Approximation of Linear Operators in p-Norms and Some Algorithms," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-12, August.
  • Handle: RePEc:wsi:apjorx:v:33:y:2016:i:04:n:s0217595916500238
    DOI: 10.1142/S0217595916500238
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595916500238
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0217595916500238?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.

    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:wsi:apjorx:v:33:y:2016:i:04:n:s0217595916500238. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.