An inexact spectral bundle method and error bounds for convex quadratic symmetric cone programming
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...
Saved in:
Main Author: | Lin, Hui Ling |
---|---|
Other Authors: | Chua Chek Beng |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/48908 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
The primal-dual second-order cone approximations algorithm for symmetric cone programming
by: Chua, Chek Beng.
Published: (2009) -
Time-inconsistent stochastic linear-quadratic control in continuous time
by: Song, Wan Jing
Published: (2021) -
A continuation method for nonlinear complementarity problems over symmetric cones
by: Chua, Chek Beng., et al.
Published: (2011) -
Analyticity of weighted central paths and error bounds for semidefinite programming
by: Chua, Chek Beng.
Published: (2009) -
Non-asymptotic bounds for modified tamed unadjusted Langevin algorithm in non-convex setting
by: Ng, Matthew Cheng En
Published: (2022)