Please use this identifier to cite or link to this item:
Title: An inexact spectral bundle method and error bounds for convex quadratic symmetric cone programming
Authors: Lin, Hui Ling
Keywords: DRNTU::Science::Mathematics::Applied mathematics::Operational research
Issue Date: 2012
Source: Lin, Hui Ling. (2012). An inexact spectral bundle method and error bounds for convex quadratic symmetric cone programming. Doctoral thesis, Nanyang Technological University, Singapore.
Abstract: We 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.
DOI: 10.32657/10356/48908
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Theses

Files in This Item:
File Description SizeFormat 
TspmsG0800460K.pdf814.95 kBAdobe PDFThumbnail

Page view(s) 50

Updated on Dec 2, 2020

Download(s) 20

Updated on Dec 2, 2020

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.