{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T22:28:35Z","timestamp":1773181715789,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,12,5]],"date-time":"2013-12-05T00:00:00Z","timestamp":1386201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s10957-013-0496-0","type":"journal-article","created":{"date-parts":[[2013,12,4]],"date-time":"2013-12-04T22:48:21Z","timestamp":1386197301000},"page":"735-753","source":"Crossref","is-referenced-by-count":21,"title":["Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs"],"prefix":"10.1007","volume":"162","author":[{"given":"V.","family":"Jeyakumar","sequence":"first","affiliation":[]},{"given":"J.","family":"Vicente-P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,5]]},"reference":[{"key":"496_CR1","volume-title":"Resource Allocation Problems: Algorithmic Approaches. Foundations of Computing Series","author":"T. Ibaraki","year":"1988","unstructured":"Ibaraki, T., Katoh, N.: Resource Allocation Problems: Algorithmic Approaches. Foundations of Computing Series. MIT Press, Cambridge (1988)"},{"key":"496_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1023\/A:1022601301102","volume":"98","author":"G. Yu","year":"1998","unstructured":"Yu, G.: Min-max optimization of several classical discrete optimization problems. J. Optim. Theor. Appl. 98, 221\u2013242 (1998)","journal-title":"J. Optim. Theor. Appl."},{"key":"496_CR3","series-title":"Princeton Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A. Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: In: Robust Optimization. Princeton Series in Applied Mathematics (2009)"},{"key":"496_CR4","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D. Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53, 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"key":"496_CR5","doi-asserted-by":"crossref","first-page":"3384","DOI":"10.1137\/100791841","volume":"20","author":"V. Jeyakumar","year":"2010","unstructured":"Jeyakumar, V., Li, G.: Strong duality in robust convex programming: complete characterizations. SIAM J. Optim. 20, 3384\u20133407 (2010)","journal-title":"SIAM J. Optim."},{"key":"496_CR6","series-title":"Springer Monographs in Mathematics","volume-title":"Asymptotic Cones and Functions in Optimization and Variational Inequalities","author":"A. Auslender","year":"2003","unstructured":"Auslender, A., Teboulle, M.: Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer Monographs in Mathematics. Springer, New York (2003)"},{"key":"496_CR7","doi-asserted-by":"crossref","DOI":"10.1142\/p665","volume-title":"Moments, Positive Polynomials and Their Applications","author":"J.B. Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2009)"},{"key":"496_CR8","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.orl.2012.09.006","volume":"40","author":"V. Jeyakumar","year":"2012","unstructured":"Jeyakumar, V., Li, G.: Exact SDP relaxations for classes of nonlinear semidefinite programming problems. Oper. Res. Lett. 40, 529\u2013536 (2012)","journal-title":"Oper. Res. Lett."},{"key":"496_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"496_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-008-0240-y","volume":"122","author":"J.W. Helton","year":"2010","unstructured":"Helton, J.W., Nie, J.: Semidefinite representation of convex sets. Math. Program. Ser. A 122, 21\u201364 (2010)","journal-title":"Math. Program. Ser. A"},{"key":"496_CR11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10107-011-0457-z","volume":"135","author":"A.A. Ahmadi","year":"2012","unstructured":"Ahmadi, A.A., Parrilo, P.A.: A convex polynomial that is not sos-convex. Math. Program. Ser. A 135, 275\u2013292 (2012)","journal-title":"Math. Program. Ser. A"},{"key":"496_CR12","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1137\/110856010","volume":"23","author":"A.A. Ahmadi","year":"2013","unstructured":"Ahmadi, A.A., Parrilo, P.A.: A complete characterization of the gap between convexity and SOS-convexity. SIAM J. Optim. 23, 811\u2013833 (2013)","journal-title":"SIAM J. Optim."},{"key":"496_CR13","series-title":"IMA Vol. Math. Appl.","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-0-387-09686-5_7","volume-title":"Emerging Applications of Algebraic Geometry","author":"M. Laurent","year":"2009","unstructured":"Laurent, M.: Sums of squares, moment matrices and optimization over polynomials. In: Emerging Applications of Algebraic Geometry. IMA Vol. Math. Appl., vol. 149, pp. 157\u2013270. Springer, New York (2009)"},{"key":"496_CR14","first-page":"4797","volume-title":"Proc. 47th IEEE Conf. Decision and Control","author":"J.W. Helton","year":"2008","unstructured":"Helton, J.W., Nie, J.: Structured semidefinite representation of some convex sets. In: Proc. 47th IEEE Conf. Decision and Control, Cancun, Mexico, pp. 4797\u20134800 (2008)"},{"key":"496_CR15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1014813701864","volume":"22","author":"E.G. Belousov","year":"2002","unstructured":"Belousov, E.G., Klatte, D.: A Frank-Wolfe type theorem for convex polynomial programs. Comput. Optim. Appl. 22, 37\u201348 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"496_CR16","doi-asserted-by":"crossref","DOI":"10.1142\/5021","volume-title":"Convex Analysis in General Vector Spaces","author":"C. Z\u0103linescu","year":"2002","unstructured":"Z\u0103linescu, C.: Convex Analysis in General Vector Spaces. World Scientific, River Edge (2002)"},{"key":"496_CR17","series-title":"MPS-SIAM Series on Optimization","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A. Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: In: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization (2001)"},{"key":"496_CR18","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1007\/s11117-005-0003-4","volume":"10","author":"R.I. Bo\u0163","year":"2006","unstructured":"Bo\u0163, R.I., Wanka, G.: Farkas-type results for max-functions and applications. Positivity 10, 761\u2013777 (2006)","journal-title":"Positivity"},{"key":"496_CR19","series-title":"Grundlehren der Mathematischen Wissenschaften","volume-title":"Convex Analysis and Minimization Algorithms I","author":"J.B. Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I. Grundlehren der Mathematischen Wissenschaften, vol. 306. Springer, Berlin (1993)"},{"key":"496_CR20","series-title":"Classics in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"F.H. Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis, 2nd edn. Classics in Applied Mathematics, vol. 5. Society for Industrial and Applied Mathematics, Philadelphia (1990)","edition":"2"},{"key":"496_CR21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF00941314","volume":"47","author":"J.P. Crouzeix","year":"1985","unstructured":"Crouzeix, J.P., Ferland, J.A., Schaible, S.: An algorithm for generalized fractional programs. J. Optim. Theory Appl. 47, 35\u201349 (1985)","journal-title":"J. Optim. Theory Appl."},{"key":"496_CR22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1021771011210","volume":"101","author":"H.C. Lai","year":"1999","unstructured":"Lai, H.C., Liu, J.C., Tanaka, K.: Duality without a constraint qualification for minimax fractional programming. J. Optim. Theory Appl. 101, 109\u2013125 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"496_CR23","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0377-2217(83)90153-4","volume":"12","author":"S. Schaible","year":"1983","unstructured":"Schaible, S., Iberaki, T.: Fractional programming. Eur. J. Oper Res. 12, 325\u2013338 (1983)","journal-title":"Eur. J. Oper Res."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0496-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-013-0496-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-013-0496-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T12:29:19Z","timestamp":1564921759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-013-0496-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,5]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["496"],"URL":"https:\/\/doi.org\/10.1007\/s10957-013-0496-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,5]]}}}