IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v100y2024i2d10.1007_s00186-024-00866-z.html
   My bibliography  Save this article

How to project onto the intersection of a closed affine subspace and a hyperplane

Author

Listed:
  • Heinz H. Bauschke

    (University of British Columbia)

  • Dayou Mao

    (University of Waterloo)

  • Walaa M. Moursi

    (University of Waterloo
    Mansoura University)

Abstract

Affine subspaces are translates of linear subspaces, and hyperplanes are well-known instances of affine subspaces. In basic linear algebra, one encounters the explicit formula for projecting onto a hyperplane. An interesting—and relevant for applications—question is whether or not there is a formula for projecting onto the intersection of two hyperplanes. The answer turns out to be yes, as demonstrated recently by Behling, Bello-Cruz, and Santos, by López, by Needell and Ward, and by Ouyang. Most of these authors also provided formulas for projecting onto the intersection of an affine subspace and a hyperplane. In this note, we present an alternative approach which has the advantage of being more explicit and more elementary. Our results also provide useful information in the case when the two sets don’t intersect. Luckily, the material is fully accessible to readers with a basic background in linear algebra and analysis. Finally, we demonstrate the computational efficiency of our formula when applied to an image reconstruction problem arising in Computed Tomography, and we also present a new formula for the projection onto the set of generalized bistochastic matrices with a moment constraint.

Suggested Citation

  • Heinz H. Bauschke & Dayou Mao & Walaa M. Moursi, 2024. "How to project onto the intersection of a closed affine subspace and a hyperplane," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(2), pages 411-435, October.
  • Handle: RePEc:spr:mathme:v:100:y:2024:i:2:d:10.1007_s00186-024-00866-z
    DOI: 10.1007/s00186-024-00866-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-024-00866-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00186-024-00866-z?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.

    References listed on IDEAS

    as
    1. Francisco J. Aragón Artacho & Rubén Campoy & Matthew K. Tam, 2020. "The Douglas–Rachford algorithm for convex and nonconvex feasibility problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(2), pages 201-240, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:mathme:v:100:y:2024:i:2:d:10.1007_s00186-024-00866-z. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.