Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/122002
Title: EFFICIENT ALGORITHMS FOR LEAST SQUARES SEMIDEFINITE PROGRAMMING AND SEMIDEFINITE PROGRAMMING WITH A LARGE NUMBER OF CONSTRAINTS
Authors: YANG LIUQIN
Keywords: semidefinite programming, accelerated block coordinate descent, multiblock ADMM, augmented Lagrangian, semismooth Newton-CG method, degeneracy
Issue Date: 31-Jul-2015
Citation: YANG LIUQIN (2015-07-31). EFFICIENT ALGORITHMS FOR LEAST SQUARES SEMIDEFINITE PROGRAMMING AND SEMIDEFINITE PROGRAMMING WITH A LARGE NUMBER OF CONSTRAINTS. ScholarBank@NUS Repository.
Abstract: This thesis focuses on designing efficient algorithms for solving large scale least squares semidefinite programming (LSSDP) and linear semidefinite programming (SDP). We first propose an inexact accelerated block coordinate descent (ABCD) method for solving LSSDP via its dual, which has the attractive O(1/k^2) iteration complexity if the subproblems are solved progressively more accurately. Next we design a convergent semi-proximal alternating direction method of multipliers for convex programming problems having three separable blocks in the objective function with the third part being linear. In the last part, we present a majorized semismooth Newton-CG augmented Lagrangian method, called SDPNAL+, for SDP with partial or full nonnegative constraints on the matrix variable. Numerical results for various large scale LSSDPs and SDPs show that the proposed three method is not only fast but also robust in obtaining accurate solutions. They outperform, by a significant margin, other competitive first order methods.
URI: http://scholarbank.nus.edu.sg/handle/10635/122002
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
YangLQ.pdf1.31 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

123
checked on Nov 16, 2018

Download(s)

64
checked on Nov 16, 2018

Google ScholarTM

Check


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