It is well-known that the sequence of iterations of the composition of projections onto closed affine subspaces converges linearly to the projection onto the intersection of the affine subspaces when the sum of the corresponding linear subspaces is closed. Inspired by this, we systematically study the relation between the projection onto intersection of halfspaces and hyperplanes, and the composition of projections onto halfspaces and hyperplanes. In addition, as by-products, we provide the Karush-Kuhn-Tucker conditions for characterizing the optimal solution of convex optimization with finitely many equality and inequality constraints in Hilbert spaces and construct an explicit formula for the projection onto the intersection of hyperplane and halfspace.

Contact details are reproduced from the original publication and may be historical.

Hui Ouyang

Dept. of Mathematics, University of British Columbia, Kelowna B.C., Canada

hui.ouyang@ubc.ca
  1. H. H. Bauschke, P. L. Combettes: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edition, CMS Books in Mathematics, Springer, Berlin (2017).https://doi.org/10.1007/978-3-319-48311-5Google Scholar
  2. H. H. Bauschke, V. R. Koch: Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces, Contemp. Math. 636 (2015) 1–40.https://doi.org/10.1090/conm/636/12726Google Scholar
  3. H. H. Bauschke, H. Ouyang, X. Wang: On circumcenter mappings induced by nonexpansive operators, Pure Applied Functional Analysis 6/2 (2021) 257–288.Google Scholar
  4. H. H. Bauschke, H. Ouyang, X. Wang: Best approximation mappings in Hilbert spaces, arXiv: 2006.02644 (2020).Google Scholar
  5. A. Beck: First-Order Methods in Optimization, SIAM, Philadelphia (2017).https://doi.org/10.1137/1.9781611974997Google Scholar
  6. R. Behling, J. Y. Bello Cruz, L.-R. Santos: The block-wise circumcentered-reflection method, Comp. Optimization Appl. 76 (2019) 675–699.https://doi.org/10.1007/s10589-019-00155-0Google Scholar
  7. S. Boyd, L. Vandenberghe: Convex Optimization, Cambridge University Press, Cambridge (2004).https://doi.org/10.1017/CBO9780511804441Google Scholar
  8. A. Cegielski: Iterative Methods for Fixed Point Problems in Hilbert Spaces, Springer, Berlin (2012).https://doi.org/10.1007/978-3-642-30901-4Google Scholar
  9. M. N. Dao, N. D. Dizon, J. A. Hogan, M. K. Tam: Constraint reduction reformulations for projection algorithms with applications to wavelet construction, arXiv: 2006.05898 (2020).Google Scholar
  10. F. Deutsch: Best Approximation in Inner Product Spaces, CMS Books in Mathematics, Springer, New York (2012).Google Scholar
  11. F. Deutsch, H. Hundal: The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators, J. Approx. Theory 142 (2006) 56–82.https://doi.org/10.1016/j.jat.2006.02.006Google Scholar
  12. E. Kreyszig: Introductory Functional Analysis with Applications, John Wiley & Sons, New York (1989).Google Scholar
  13. D. G. Luenberger: Optimization by Vector Space Methods, John Wiley & Sons, New York (1969).Google Scholar
  14. C. Meyer: Matrix Analysis and Applied Linear Algebra, SIAM, Philadelphia (2000).https://doi.org/10.1137/1.9780898719512Google Scholar
  15. R. T. Rockafellar: Convex Analysis, Princeton Landmarks in Mathematics, Princeton University Press, Princeton (1997).Google Scholar
  16. W. Schirotzek: Nonsmooth Analysis, Universitext, Springer, Berlin (2007).https://doi.org/10.1007/978-3-540-71333-3Google Scholar

H. Ouyang. “Projecting onto Intersections of Halfspaces and Hyperplanes.” Journal of Convex Analysis 28 (2021), No. 3, 983–1014. https://doi.org/10.68381/jca28058