{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T17:42:08Z","timestamp":1776793328859,"version":"3.51.2"},"reference-count":26,"publisher":"American Mathematical Society (AMS)","issue":"275","license":[{"start":{"date-parts":[[2011,12,16]],"date-time":"2011-12-16T00:00:00Z","timestamp":1323993600000},"content-version":"am","delay-in-days":365,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>Ariyawansa and Zhu have recently proposed a new class of optimization problems termed stochastic semidefinite programs (SSDPs). SSDPs may be viewed as an extension of two-stage stochastic (linear) programs with recourse (SLPs). Zhao has derived a decomposition algorithm for SLPs based on a logarithmic barrier and proved its polynomial complexity. Mehrotra and \u00d6zevin have extended the work of Zhao to the case of SSDPs to derive a polynomial logarithmic barrier decomposition algorithm for SSDPs. An alternative to the logarithmic barrier is the volumetric barrier of Vaidya. There is no work based on the volumetric barrier analogous to that of Zhao for SLPs or to the work of Mehrotra and \u00d6zevin for SSDPs. The purpose of this paper is to derive a class of volumetric barrier decomposition algorithms for SSDPs, and to prove polynomial complexity of certain members of the class.<\/p>","DOI":"10.1090\/s0025-5718-2010-02449-4","type":"journal-article","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T14:40:02Z","timestamp":1293633602000},"page":"1639-1661","source":"Crossref","is-referenced-by-count":12,"title":["A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming"],"prefix":"10.1090","volume":"80","author":[{"given":"K.","family":"Ariyawansa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuntao","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[2010,12,16]]},"reference":[{"issue":"1","key":"1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","article-title":"Interior point methods in semidefinite programming with applications to combinatorial optimization","volume":"5","author":"Alizadeh, Farid","year":"1995","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"1","key":"2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/moor.22.1.63","article-title":"On Vaidya\u2019s volumetric cutting plane method for convex programming","volume":"22","author":"Anstreicher, Kurt M.","year":"1997","journal-title":"Math. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0364-765X","issn-type":"print"},{"issue":"1","key":"3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0025-5610(96)00042-1","article-title":"Volumetric path following algorithms for linear programming","volume":"76","author":"Anstreicher, Kurt M.","year":"1997","journal-title":"Math. Programming","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"3","key":"4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1287\/moor.25.3.365.12212","article-title":"The volumetric barrier for semidefinite programming","volume":"25","author":"Anstreicher, Kurt M.","year":"2000","journal-title":"Math. Oper. Res.","ISSN":"https:\/\/id.crossref.org\/issn\/0364-765X","issn-type":"print"},{"issue":"3","key":"5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10288-006-0016-2","article-title":"Stochastic semidefinite programming: a new paradigm for stochastic optimization","volume":"4","author":"Ariyawansa, K. A.","year":"2006","journal-title":"4OR","ISSN":"https:\/\/id.crossref.org\/issn\/1619-4500","issn-type":"print"},{"issue":"2","key":"6","doi-asserted-by":"publisher","first-page":"1683","DOI":"10.1016\/j.amc.2006.08.171","article-title":"A class of volumetric barrier decomposition algorithms for stochastic quadratic programming","volume":"186","author":"Ariyawansa, K. A.","year":"2007","journal-title":"Appl. Math. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0096-3003","issn-type":"print"},{"key":"7","series-title":"Springer Series in Operations Research","isbn-type":"print","volume-title":"Introduction to stochastic programming","author":"Birge, John R.","year":"1997","ISBN":"https:\/\/id.crossref.org\/isbn\/0387982175"},{"key":"8","series-title":"Institute of Mathematics and its Applications Conference Series","isbn-type":"print","volume-title":"Stochastic programming","year":"1980","ISBN":"https:\/\/id.crossref.org\/isbn\/0122082508"},{"key":"9","series-title":"Springer Series in Computational Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61370-8","volume-title":"Numerical techniques for stochastic optimization","volume":"10","year":"1988","ISBN":"https:\/\/id.crossref.org\/isbn\/3540186778"},{"key":"10","unstructured":"A. J. Felt. A Computational Evaluation of Interior Point Cutting Plane Algorithms for Stochastic Programs. Ph.D. dissertation, Department of Pure and Applied Mathematics, Washington State University, Pullman, WA, 2000."},{"key":"11","volume-title":"Nonlinear programming: Sequential unconstrained minimization techniques","author":"Fiacco, Anthony V.","year":"1968"},{"key":"12","series-title":"Ellis Horwood Series in Mathematics and its Applications","isbn-type":"print","volume-title":"Kronecker products and matrix calculus: with applications","author":"Graham, Alexander","year":"1981","ISBN":"https:\/\/id.crossref.org\/isbn\/0853123918"},{"issue":"2","key":"13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/1034048","article-title":"Path-following methods for linear programming","volume":"34","author":"Gonzaga, Clovis C.","year":"1992","journal-title":"SIAM Rev.","ISSN":"https:\/\/id.crossref.org\/issn\/1095-7200","issn-type":"print"},{"key":"14","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix analysis","author":"Horn, Roger A.","year":"1985","ISBN":"https:\/\/id.crossref.org\/isbn\/0521305861"},{"key":"15","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in matrix analysis","author":"Horn, Roger A.","year":"1991","ISBN":"https:\/\/id.crossref.org\/isbn\/052130587X"},{"key":"16","unstructured":"P. L. Jiang. Polynomial Cutting Plane Algorithms for Stochastic Programming and Related Problems. Ph.D. dissertation, Department of Pure and Applied Mathematics, Washington State University, Pullman, WA, 1997."},{"key":"17","series-title":"Wiley-Interscience Series in Systems and Optimization","isbn-type":"print","volume-title":"Stochastic programming","author":"Kall, Peter","year":"1994","ISBN":"https:\/\/id.crossref.org\/isbn\/0471951587"},{"issue":"1","key":"18","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1137\/050622067","article-title":"Decomposition-based interior point methods for two-stage stochastic semidefinite programming","volume":"18","author":"Mehrotra, Sanjay","year":"2007","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"19","series-title":"SIAM Studies in Applied Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point polynomial algorithms in convex programming","volume":"13","author":"Nesterov, Yurii","year":"1994","ISBN":"https:\/\/id.crossref.org\/isbn\/0898713196"},{"key":"20","series-title":"Mathematics and its Applications","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic programming","volume":"324","author":"Pr\u00e9kopa, Andr\u00e1s","year":"1995","ISBN":"https:\/\/id.crossref.org\/isbn\/0792334825"},{"issue":"3","key":"21","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0025-5610(92)00021-S","article-title":"A new algorithm for minimizing convex functions over convex sets","volume":"73","author":"Vaidya, Pravin M.","year":"1996","journal-title":"Math. Programming","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"key":"22","unstructured":"R.J. Vanderbei and H.Y. Benson. On Formulating Semidefinite Programming Problems as Smooth Convex Nonlinear Optimization Problems. Working Paper, Department of Operations Research and Financial Engineering, Princeton University, Princeton, NJ, 2000."},{"issue":"1","key":"23","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","article-title":"Semidefinite programming","volume":"38","author":"Vandenberghe, Lieven","year":"1996","journal-title":"SIAM Rev.","ISSN":"https:\/\/id.crossref.org\/issn\/1095-7200","issn-type":"print"},{"key":"24","series-title":"International Series in Operations Research \\& Management Science","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of semidefinite programming","volume":"27","year":"2000","ISBN":"https:\/\/id.crossref.org\/isbn\/0792377710"},{"key":"25","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1017\/S0962492901000071","article-title":"Semidefinite optimization","volume":"10","author":"Todd, M. J.","year":"2001","journal-title":"Acta Numer.","ISSN":"https:\/\/id.crossref.org\/issn\/0962-4929","issn-type":"print"},{"issue":"3","key":"26","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/PL00011433","article-title":"A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs","volume":"90","author":"Zhao, Gongyun","year":"2001","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2011-80-275\/S0025-5718-2010-02449-4\/S0025-5718-2010-02449-4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2011-80-275\/S0025-5718-2010-02449-4\/S0025-5718-2010-02449-4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T16:52:47Z","timestamp":1776790367000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2011-80-275\/S0025-5718-2010-02449-4\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,16]]},"references-count":26,"journal-issue":{"issue":"275","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["S0025-5718-2010-02449-4"],"URL":"https:\/\/doi.org\/10.1090\/s0025-5718-2010-02449-4","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2010,12,16]]}}}