dc.contributor.authorLin, Hui Ling
dc.date.accessioned2012-05-10T08:54:21Z
dc.date.accessioned2017-07-23T08:43:39Z
dc.date.available2012-05-10T08:54:21Z
dc.date.available2017-07-23T08:43:39Z
dc.date.copyright2012en_US
dc.date.issued2012
dc.identifier.citationLin, Hui Ling. (2012). An inexact spectral bundle method and error bounds for convex quadratic symmetric cone programming. Doctoral thesis, Nanyang Technological University, Singapore.
dc.identifier.urihttp://hdl.handle.net/10356/48908
dc.description.abstractWe present an inexact spectral bundle method for solving convex quadratic symmetric cone programming (CQSCP). This method is a first-order method, hence requires much less computational cost in each iteration than second-order approaches such as interior-point methods. In each iteration of our method, we compute a largest eigenvalue inexactly, and solve a small convex quadratic symmetric cone program as a subproblem. We give a proof of the global convergence of this method using techniques from the analysis of the standard bundle method, and investigate Lipschitzian error bounds for the CQSCP problem under some mild assumptions. Finally, we describe an application of our proposed algorithm to convex quadratic semidefinite programming problems. Numerical experiments with matrices of order up to 2000 are performed, and the computational results establish the effectiveness of this method.en_US
dc.format.extent158 p.en_US
dc.language.isoenen_US
dc.subjectDRNTU::Science::Mathematics::Applied mathematics::Operational researchen_US
dc.titleAn inexact spectral bundle method and error bounds for convex quadratic symmetric cone programmingen_US
dc.typeThesis
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen_US
dc.contributor.supervisorChua Chek Bengen_US
dc.description.degreeDOCTOR OF PHILOSOPHY (SPMS)en_US


Files in this item

FilesSizeFormatView
TspmsG0800460K.pdf834.5Kbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record