Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming

References

• Németh SZ, Zhang G. Extended Lorentz cones and mixed complementarity problems. J Global Optim. 2015;62(3):443–457. doi: 10.1007/s10898-014-0259-y
   Web of Science ®Google Scholar
• Sznajder R. The Lyapunov rank of extended second order cones. J Global Optim. 2016;66:585–593. doi: 10.1007/s10898-016-0445-1
   Web of Science ®Google Scholar
• Ferreira PO, Németh SZ. How to project onto extended second order cones. J Global Optim. 2018;70(4):707–718. doi: 10.1007/s10898-017-0587-9
   Web of Science ®Google Scholar
• Németh SZ, Xiao L. Linear Complementarity Problems on Extended Second Order Cones. J Optim Theory Appl. 2018;176:269–288. doi: 10.1007/s10957-018-1220-x
   Web of Science ®Google Scholar
• Alzalg B. The Jordan algebraic structure of the circular cone. Oper Matrices. 2017;11(1):1–21. doi: 10.7153/oam-11-01
   Web of Science ®Google Scholar
• Alzalg B. Decomposition-based interior-point methods for stochastic quadratic second-order cone programming. Appl Math Comput. 2014;249:1–18.
   Web of Science ®Google Scholar
• Alzalg B. Homogeneous self-dual algorithms for stochastic second-order cone programming. J Optim Theory Appl. 2014;163(1):148–164. doi: 10.1007/s10957-013-0428-z
   Web of Science ®Google Scholar
• Alzalg B, Ariyawansa KA. Logarithmic barrier decomposition-based interior-point methods for stochastic symmetric programming. J Math Anal Appl. 2014;409:973–995. doi: 10.1016/j.jmaa.2013.07.075
   Web of Science ®Google Scholar
• Alzalg B, Pirhaji M. Elliptic cone optimization and primal-dual path-following algorithms. Optimization. 2017;66:2245–2274. doi: 10.1080/02331934.2017.1360888
   Web of Science ®Google Scholar
• Alzalg B, Pirhaji M. Primal-dual path-following algorithms for circular programming. Commun Comb Optim. 2017;2(2):65–85.
   Google Scholar
• Mennichea L, Benterki D. A logarithmic barrier approach for linear programming. J Comput Appl Math. 2017;312:267–275. doi: 10.1016/j.cam.2016.05.025
   Web of Science ®Google Scholar
• Bnouhachem A, Ansari QH, Wen C-F. A projection descent method for solving variational inequalities. J Ineq Appl. 2015;143:1–14.
   Google Scholar
• Wright S. Primal-dual interior point methods. Philadelphia: SIAM; 1997.
   Google Scholar
• Hertog D. Interior-point approach to linear quadratic and convex programming. Dordrecht: Kluwer Academic Publishers; 1994.
   Google Scholar
• Nestrov YE, Nemiroveskii A. Interior point polynomial algorithms in convex programming. Philadelphia: SIAM; 1994.
   Google Scholar
• Roos C, Terlaky T, Vial JP. Theory and algorithms for linear optimization: an interior-point approach. Chichester: W. John & Sons; 1997.
   Google Scholar
• Ye Y. Interior point algorithms: theory and analysis. New York: John wiley & Sons; 1997. (Wiley-interscience series in discrete mathematics optimization).
   Google Scholar
• Naseri R, Valinejad A. An extended variant of Karmarkar's interior point algorithm. Appl Math Comput. 2007;184:737–742.
   Web of Science ®Google Scholar
• Achache M. A weighted path-following method for the linear complementarity problem. Studia Univ Babes-Bolyai Ser Inform. 2004;48:61–73.
   Google Scholar
• Darvay Z. A weighted-path-following method for linear optimization. Studia Univ Babes-Bolyai Ser Inform. 2002;47:3–12.
   Google Scholar
• Zhao G. A log barrier method with Benders' decomposition for solving two-stage stochastic linear programs. Math Program Ser A. 2001;90:507–536. doi: 10.1007/PL00011433
   Web of Science ®Google Scholar
• Mehrotra S, Özevin MG. Decomposition-based interior point methods for two-stage stochastic semidefinite programming. SIAM J Optim. 2007;18(1):206–222. doi: 10.1137/050622067
   Web of Science ®Google Scholar
• Zhao G. A Lagrangian dual method with self-concordant barrier for multi-stage stochastic convex nonlinear programming. Math Program. 2005;102(1):1–24. doi: 10.1007/s10107-003-0471-x
   Web of Science ®Google Scholar
• Chen M, Mehrotra S. Self-concordance and decomposition based interior point methods for the two stage stochastic convex optimization problem. SIAM J Optim. 2011;21(4):1667–1687. doi: 10.1137/080742026
   Web of Science ®Google Scholar
• Lobo MS, Vandenberghe L, Boyd S, et al. Applications of second-order cone programming. Linear Algebra Appl. 1998;284:193–228. doi: 10.1016/S0024-3795(98)10032-0
   Web of Science ®Google Scholar
• Alizadeh F, Goldfarb D. Second-order cone programming. Math Program Ser B. 2003;95:3–51. doi: 10.1007/s10107-002-0339-5
   Web of Science ®Google Scholar
• Todd MJ. Semidefinite optimization. Acta Numer. 2001;10:515–560. doi: 10.1017/S0962492901000071
   Google Scholar
• Gaujal B, Mertikopoulos P. A stochastic approximation algorithm for stochastic semidefinite programming. Prob Eng Inf Sci. 2016;30(3):431–454. doi: 10.1017/S0269964816000127
   Web of Science ®Google Scholar
• Rudin W. Principles of mathematical analysis. New York: McGraw-Hill; 1976.
   Google Scholar
• Nesterov YuE, Nemirovskii AS. Interior point polynomial algorithms in convex programming. Philadelphia (PA): SIAM Publications; 1994.
   Google Scholar