Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/209001
Title: AUGMENTED LAGRANGIAN METHODS FOR A CLASS OF LARGE-SCALE CONIC PROGRAMMING
Authors: LIANG LING
ORCID iD:   orcid.org/0000-0003-0671-9561
Keywords: Augmented Lagrangian Methods, Large-scale Conic Programming, Semismooth Newton Method, Constraint Nondegeneracy, Second-Order Growth Condition, Solver
Issue Date: 28-Jul-2021
Citation: LIANG LING (2021-07-28). AUGMENTED LAGRANGIAN METHODS FOR A CLASS OF LARGE-SCALE CONIC PROGRAMMING. ScholarBank@NUS Repository.
Abstract: In this thesis, we design, analyze and implement efficient algorithms for solving a class of large-scale conic programming (CQP) problems which are fundamental problems in the field of mathematical optimization. These problems also arise from many important real-world applications. The thesis can be divided mainly into four parts. The first part of this thesis focuses on the augmented Lagrangian method for solving convex quadratic programming problems with linear and conic constraints. In the second part of the thesis, we consider solving a special class of CQP, namely second-order cone programming, which has many important real-world applications and is of independent interest by the non-polyhedral nature of the underlying second-order cone. Next, we consider the doubly nonnegative projection problem which aims to compute the projection onto the doubly nonnegative cone. In the last part of the thesis, we aim to solve large-scale convex quadratic programming problems.
URI: https://scholarbank.nus.edu.sg/handle/10635/209001
Appears in Collections:Ph.D Theses (Open)

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

OPEN

NoneView/Download

Page view(s)

43
checked on Sep 22, 2022

Download(s)

16
checked on Sep 22, 2022

Google ScholarTM

Check


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