Theory and algorithms for matrix problems with positive semidefinite constraints
This thesis presents new theoretical results and algorithms for two matrix problems with positive semidefinite constraints: it adds to the well-established nearest correlation matrix problem, and introduces a class of semidefinite Lagrangian subspaces. First, we propose shrinking, a method for resto...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
University of Manchester
2016
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.684825 |