Please use this identifier to cite or link to this item:
Title: An inexact SQP Newton method for convex SC1 minimization problems
Authors: CHEN YIDI
Keywords: SC1 minimization, inexact SQP Newton method, super-linear convergence
Issue Date: 2-Mar-2009
Citation: CHEN YIDI (2009-03-02). An inexact SQP Newton method for convex SC1 minimization problems. ScholarBank@NUS Repository.
Abstract: The convex SC1 minimization problems model many problems as special cases. One particular example is the dual problem of the least squares covariance matrix (LSCM) problems with inequality constraints. The purpose of this thesis is to introduce an efficient inexact SQP Newton method for solving the general convex SC1 minimization problems under realistic assumptions. In Chapter 2, we introduce our method and conduct a complete convergence analysis including the super-linear (quadratic) rate of convergence. Numerical results conducted in Chapter 3 show that our inexact SQP Newton method is competitive when it is applied to the LSCM problems with many lower and upper bounds constraints. We make our final conclusions in Chapter 4.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ChenYidi_Master_Mathematics_AnInexactSQP-NewtonMethodForConvexSC1MinimizationProblems_2008.pdf277.28 kBAdobe PDF



Page view(s)

checked on Apr 20, 2019


checked on Apr 20, 2019

Google ScholarTM


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