{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T09:08:52Z","timestamp":1787389732680,"version":"build-2736575974"},"reference-count":30,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Control Optim."],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1137\/060650532","type":"journal-article","created":{"date-parts":[[2009,6,12]],"date-time":"2009-06-12T18:07:06Z","timestamp":1244830026000},"page":"2118-2138","source":"Crossref","is-referenced-by-count":22,"title":["Separated Continuous Conic Programming: Strong Duality and an Approximation Algorithm"],"prefix":"10.1137","volume":"48","author":[{"given":"Xiaoqing","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David D.","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2009,6,12]]},"reference":[{"key":"R1","unstructured":"E. J. Anderson,\n                      A Continuous Model for Job-Shop Scheduling\n                      , Ph.D. thesis, University of Cambridge, Cambridge, UK, 1978."},{"key":"R2","unstructured":"B. D. O. Anderson and J. B. Moore,\n                      Optimal Control: Linear Quadratic Methods\n                      , Prentice-Hall, Englewood Cliffs, NJ, 1989."},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0321046"},{"key":"R4","unstructured":"E. J. Anderson and P. Nash,\n                      Linear Programming in Infinite-Dimensional Spaces: Theory and Applications\n                      , John Wiley & Sons, Chichester, UK, 1987."},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190403"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012992227216"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"R. E. Bellman,\n                      Bottleneck problem and dynamic programming\n                      , Proc. Nat. Acad. Sci., 39 (1953) pp. 947\u2013951.","DOI":"10.1073\/pnas.39.9.947"},{"key":"R8","unstructured":"R. E. Bellman,\n                      Dynamic Programming\n                      , Princeton University Press, Princeton, NJ, 1957."},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.4.769"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.6.1104"},{"key":"R11","unstructured":"H. Chen and D. D. Yao,\n                      Fundamentals of Queueing Networks: Performance, Asymptotics and Optimization\n                      , Appl. Math. 46, Springer-Verlag, New York, 2001."},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012903429529"},{"key":"R13","unstructured":"V. Chv\u00e1tal,\n                      Linear Programming\n                      , W. H. Freeman and Company, New York, 1980."},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004828"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1287\/moor.21.1.115"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1050.0166"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012904441969"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012995292664"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"Yu. Nesterov and A. Nemirovskii,\n                      Interior-Point Polynomial Algorithms in Convex Programming\n                      , SIAM, Philadelphia, 1994.","DOI":"10.1137\/1.9781611970791"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/0331073"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012993247858"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012993257507"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1006\/jmaa.1996.0016"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495288180"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494278827"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0307-0"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"A. Shapiro,\n                      On duality theory of conic linear problems\n                      , in Semi-Infinite Programming, M. A. Goberna and M. A. Lopez, eds., Kluwer Academic, Dordrecht, The Netherlands, 2001, pp. 135\u2013165.","DOI":"10.1007\/978-1-4757-3403-4_7"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"R29","unstructured":"X. Wang,\n                      Theory and Algorithms for Separated Continuous Linear Programming and Its Extensions\n                      , Ph.D. thesis, The Chinese University of Hong Kong, Hong Kong, China, 2005."},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0217-x"}],"container-title":["SIAM Journal on Control and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/060650532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:51:12Z","timestamp":1787316672000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/060650532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.1137\/060650532"],"URL":"https:\/\/doi.org\/10.1137\/060650532","relation":{},"ISSN":["0363-0129","1095-7138"],"issn-type":[{"value":"0363-0129","type":"print"},{"value":"1095-7138","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}