Please use this identifier to cite or link to this item:
Title: On alternating direction methods for monotropic semidefinite programming
Authors: ZHANG SU
Keywords: monotropic, semidefinite programming, alternating direction method, variational inequality, covariance matrix estimation, matrix completion
Issue Date: 14-Sep-2009
Citation: ZHANG SU (2009-09-14). On alternating direction methods for monotropic semidefinite programming. ScholarBank@NUS Repository.
Abstract: This thesis studies a new optimization model called monotropic semidefinite programming. This model extends the monotropic programming model from vectors to matrices on one hand, and the linear semidefinite programming model to the convex case on the other hand.We propose several modified alternating direction methods for solving monotropic semidefinite programming problems. In order to avoid solving difficult sub-variational inequality problems on matrix space at each iteration, we establish a set of projection-based algorithms. We discuss alternating direction methods in different ways to deal with quadratic objective and general nonlinear objective. These methods can be used to solve convex nonlinear semidefinite programming problems. A practical application comes from the covariance matrix estimation problem. Another practical application is the matrix completion problem. Both of them can be modeled as convex matrix optimization problems and certain modified alternating direction methods apply. We also conduct numerical tests for problems arising from these applications.
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ZhangS.pdf415.76 kBAdobe PDF



Page view(s)

checked on Apr 19, 2019


checked on Apr 19, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.