This dissertation describes optimization methods and matrix factorizations for large-scale quasi-Newton trust-region methods. The proposed methods are applicable to convex and non-convex optimization problems, and are described in algorithms for software implementations.
