Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/26214
Title: A Cone Constrained Convex Program : structure and Algorithms
Authors: Qi, L 
Xu, Y
Yuan, YX
Zhang, X
Keywords: Algorithms
Cone
Convex program
Positive semi-definiteness
Space tensor
Issue Date: 2013
Publisher: Springer Berlin
Source: Journal of the Operations Research Society of China, 2013, v. 1, no. 1, p. 37-53 How to cite?
Journal: Journal of the Operations Research Society of China 
Abstract: In this paper, we consider the positive semi-definite space tensor cone constrained convex program, its structure and algorithms. We study defining functions, defining sequences and polyhedral outer approximations for this positive semi-definite space tensor cone, give an error bound for the polyhedral outer approximation approach, and thus establish convergence of three polyhedral outer approximation algorithms for solving this problem. We then study some other approaches for solving this structured convex program. These include the conic linear programming approach, the nonsmooth convex program approach and the bi-level program approach. Some numerical examples are presented.
URI: http://hdl.handle.net/10397/26214
ISSN: 2194-668X
DOI: 10.1007/s40305-013-0005-z
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

4
Last Week
0
Last month
1
Citations as of Sep 22, 2017

Page view(s)

34
Last Week
4
Last month
Checked on Sep 25, 2017

Google ScholarTM

Check

Altmetric



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