Separated continuous conic programming: Strong duality and an approximation algorithm

Xiaoqing Wang, Shuzhong Zhang, David D. Yao

Research output: Contribution to journalArticlepeer-review

19 Scopus citations


Motivated by recent applications in robust optimization and in sign-constrained linear-quadratic control, we study in this paper a new class of optimization problems called separated continuous conic programming (SCCP). Focusing on a symmetric primal-dual pair, we develop a strong duality theory for the SCCP. Our idea is to use discretization to connect the SCCP and its dual to two ordinary conic programs. We show if the latter are strongly feasible and with finite optimal values, a condition that is readily verifiable, then the strong duality holds for the SCCP. This approach also leads to a polynomial-time approximation algorithm that solves the SCCP to any required accuracy.

Original languageEnglish (US)
Pages (from-to)2118-2138
Number of pages21
JournalSIAM Journal on Control and Optimization
Issue number4
StatePublished - 2009


  • Approximation algorithm
  • Conic programming
  • Continuous optimization
  • Duality

Fingerprint Dive into the research topics of 'Separated continuous conic programming: Strong duality and an approximation algorithm'. Together they form a unique fingerprint.

Cite this