Font Size: a A A

Efficient algorithms for least squares semidefinite programming and linear semidefinite programming with a large number of constraint

Posted on:2016-11-20Degree:Ph.DType:Thesis
University:National University of Singapore (Singapore)Candidate:Liuqin, YangFull Text:PDF
GTID:2470390017480463Subject:Mathematics
Abstract/Summary:
This thesis focuses on designing efficient algorithms for solving large scale semidfinite programming, which have many applications in a wide range of fields, such as combinatorial optimization, robust optimization, option pricing, correlation/covariance matrix estimation, kernel estimation and so on. (Abstract shortened by UMI.).
Keywords/Search Tags:Programming
Related items