Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/13388
Title: Two problems in convex conic optimization
Authors: ZHAI XIAOJUN
Keywords: SEBB, QSDP, smooth, preconditioner
Issue Date: 18-Sep-2007
Source: ZHAI XIAOJUN (2007-09-18). Two problems in convex conic optimization. ScholarBank@NUS Repository.
Abstract: In the first part of the thesis we focus on smallest enclosing ball problem. We implement Nesterova??s smoothing technique and present a new modified back-tracking algorithm to solve the problem.The second part of the thesis is on the generalized convex quadratic semidefinite program (GQSDP). We use the primal-dual path following method to solve(GQSDP). To deal with the ill-conditioned linear system, we design two types of preconditioners and prove their effectiveness. At last, we show some numerical results on the primal-dual path following method of solving (QSDP).
URI: http://scholarbank.nus.edu.sg/handle/10635/13388
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesiszhai.pdf315.47 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

269
checked on Dec 11, 2017

Download(s)

195
checked on Dec 11, 2017

Google ScholarTM

Check


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