University of British Columbia
Nonconvex projections arising in bilinear mathematical models
Abstract
dc:descriptionThis thesis contributes to the study of projection operators associated with bilinear sets. Bilinear sets are not convex and appear in many applications such as deep learning, inverse problems, and other bilinear models in control and optimization. The closed-form projection formulas for some of these bilinear sets namely crosses, hyperbolas, and hyperbolic paraboloids are provided. Along the way, a convenient presentation for the roots of cubic polynomials is highlighted and utilized further to develop more projection formulas and proximal mappings which are essential tools used in projection algorithms and proximal splitting algorithms. The notion of Fejer monotonicity is instrumental in unifying the convergence proofs of many iterative methods, such as the Krasnoselskii-Mann iteration, the proximal point method, and the projection algorithms. In a finite-dimensional Hilbert space, the sequences generated by the proximal point algorithm enjoy directionally asymptotic properties. A comprehensive study of directionally asymptotical results of strongly convergent subsequences of Fejer monotone sequences in general Hilbert spaces is provided along with some detailed examples. We also provide a foundational mathematical model of Elser’s framework for matrix factorization.
Degree
thesis:*- Name thesis:degree_name
- Doctor of Philosophy - PhD
- Level thesis:degree_level
- doctoral
- Discipline thesis:degree_discipline
- Mathematics
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 2023
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Krishan Lal , Manish
- Contributors dc:contributor
-
- Wang, Xianfu
- Bauschke, Heinz H.
Rights
dc:rights- Statement dc:rights
-
- Attribution-NonCommercial-NoDerivatives 4.0 International
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/86955