A Cone Constrained Convex Program: Structure and Algorithms

Liqun Qi, Yi Xu, Ya Xiang Yuan, Xinzhen Zhang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

4 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)37-53
Number of pages17
JournalJournal of the Operations Research Society of China
Issue number1
Publication statusPublished - 1 Jan 2013


  • Algorithms
  • Cone
  • Convex program
  • Positive semi-definiteness
  • Space tensor

ASJC Scopus subject areas

  • General Decision Sciences


Dive into the research topics of 'A Cone Constrained Convex Program: Structure and Algorithms'. Together they form a unique fingerprint.

Cite this