A Smooth C-Function-Based ERM Method for Stochastic Symmetric Cone Linear Complementarity Problems

References

• [1] Alizadeh F, Goldfarb D (2003) Second-order cone programming. Math. Programming 95(1):3–51.Crossref, Google Scholar
• [2] Alizadeh F, Xia Y (2011) The Q method for symmetric cone programming. J. Optim. Theory Appl. 149(1):102–137.Crossref, Google Scholar
• [3] Baesa M, Li H (2015) A Lipschitzian error bound for monotone symmetric cone linear complementarity problem. Optimization 64(11):2395–2416.Crossref, Google Scholar
• [4] Bi S, Pan S, Chen JS (2012) The same growth of FB and NR symmetric cone complementarity functions. Optim. Lett. 6:153–162.Crossref, Google Scholar
• [5] Chen XJ, Fukushima M (2005) Expected residual minimization method for stochastic linear complementarity problems. Math. Oper. Res. 30(4):1022–1038.Link, Google Scholar
• [6] Chen XJ, Zhang C (2009) Smoothing projected gradient method and its application to stochastic linear complementarity problems. SIAM J. Optim. 20(2):627–649.Crossref, Google Scholar
• [7] Chen XJ, Zhang C, Fukushima M (2009) Robust solution of monotone stochastic linear complementarity problems. Math. Programming 117(1):51–80.Crossref, Google Scholar
• [8] Faraut J, Korányi A (1994) Analysis on Symmetric Cones (Oxford University Press, Oxford, UK).Crossref, Google Scholar
• [9] Farivar M, Low SH (2012) Branch flow model: Relaxations and convexification. IEEE 51st Annual Conf. Decision Control (IEEE, Piscataway, NJ), 3672–3679.Google Scholar
• [10] Gan L, Li N, Topcu U, Low SH (2015) Exact convex relaxation of optimal power flow in radial networks. IEEE Trans. Automatic Control 60(1):72–87.Crossref, Google Scholar
• [11] Gowda MS, Song Y (2000) On semidefinite linear complementarity problems. Math. Programming 88:575–587.Crossref, Google Scholar
• [12] Gowda MS, Song Y (2002) Some new results for the semidefinite linear complementarity problem. SIAM J. Matrix Anal. Appl. 24(1):25–39.Crossref, Google Scholar
• [13] Gowda MS, Sznajder R (2007) Some global uniqueness and solvability results for linear complementarity problems over symmetric cones. SIAM J. Optim. 18(2):461–481.Crossref, Google Scholar
• [14] Han DR (2007) On the coerciveness of some merit functions for complementarity problems over symmetric cones. J. Math. Anal. Appl. 336(1):727–737.Crossref, Google Scholar
• [15] Huang ZH, Ni T (2010) Smoothing algorithms for complementarity problems over symmetric cones. Comput. Optim. App. 45(3):557–579.Crossref, Google Scholar
• [16] Huang YK, Liu HW, Zhou S (2014) A Barzilai-Borwein type method for stochastic linear complementarity problems. Numer. Algorithms 67(3):477–489.Crossref, Google Scholar
• [17] Jeyaraman I, Vetrive V (2011) On the Lipschitzian property in linear complementarity problems over symmetric cones. Linear Algebra Appl. 435(4):842–851.Crossref, Google Scholar
• [18] Kong LC, Sun J, Xiu NH (2008) A regularized smoothing Newton method for symmetric cone complementarity problems. SIAM J. Optim. 19(3):1028–1047.Crossref, Google Scholar
• [19] Kong LC, Tunçel L, Xiu NH (2009) Vector-valued implicit Lagrangian for symmetric cone complementarity problems. Asia Pacific J. Oper. Res. 26(2):199–233.Crossref, Google Scholar
• [20] Kong LC, Tunçel L, Xiu NH (2010) The Fischer-Burmeister complementarity function on Euclidean Jordan algebras. Pacific J. Optim. 6(2):423–440.Google Scholar
• [21] Kong LC, Tunçel L, Xiu NH (2012) Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems. Math. Programming 133:327–336.Crossref, Google Scholar
• [22] Krejić N, Jerinkić NK, Rapajić S (2016) Barzilai-Borwein method with variable sample size for stochastic linear complementarity problems. Optimization 65(2):479–499.Crossref, Google Scholar
• [23] Lin GH, Luo MJ, Zhang DL, Zhang J (2017) Stochastic second-order-cone complementarity problems: Expected residual minimization formulation and its applications. Math. Programming 165:197–233.Crossref, Google Scholar
• [24] Liu JX, Lan ZF, Li SJ (2024) Expected residual minimization method for a class of stochastic tensor variational inequalities. J. Oper. Res. Soc. China, ePub ahead of print October 19, https://doi.org/10.1007/s40305-024-00569-6.Crossref, Google Scholar
• [25] Liu CH, Shang YL, Han P (2017) A new infeasible-interior-point algorithm for linear programming over symmetric cones. Acta Math. Appl. Sinica English Ser. 33:771–788.Crossref, Google Scholar
• [26] López J, López R, Ramírez HC (2013) Linear complementarity problems over symmetric cones: Characterization of Qb-transformations and existence results. J. Optim. Theory Appl. 159:741–768.Crossref, Google Scholar
• [27] Lu N, Huang ZH (2014) A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems. J. Optim. Theory Appl. 161:446–464.Crossref, Google Scholar
• [28] Luo MJ, Lin GH (2009) Convergence results of the ERM method for nonlinear stochastic variational inequality problems. J. Optim. Theory Appl. 142(3):569–581.Crossref, Google Scholar
• [29] Luo MJ, Zhang Y (2018) Smoothing sample average approximation method for solving stochastic second-order-cone complementarity problems. J. Inequalities Appl. 77:1–13.Google Scholar
• [30] McCarl BA, Meeraus A, van der Eijk P, Bussieck M, Dirkse S, Steacy P, Nelissen F (2014) McCarl GAMS User Guide (Washington, DC).Google Scholar
• [31] Ming Z, Zhang L, Qi L (2020) Expected residual minimization method for monotone stochastic tensor complementarity problem. Comput. Optim. Appl. 77(3):871–896.Crossref, Google Scholar
• [32] Patrick B (1995) Probability and Measure (Wiley, New York).Google Scholar
• [33] Ramírez H, Sossa D (2017) On the central paths in symmetric cone programming. J. Optim. Theory Appl. 172:649–668.Crossref, Google Scholar
• [34] Shapiro A, Xu HF (2008) Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation. Optimization 57(3):395–418.Crossref, Google Scholar
• [35] Soroudi A (2017) Power System Optimization Modeling in GAMS (Springer, Cham, Switzerland).Crossref, Google Scholar
• [36] Sun DF, Sun J (2008) Löwner’s operator and spectral functions in Euclidean Jordan algebras. Math. Oper. Res. 33(2):421–445.Link, Google Scholar
• [37] Sun G, Zhang J, Yu LY, Lin GH (2019) A new complementarity function and applications in stochastic second-order cone complementarity problems. J. Oper. Res. Soc. China 7(2):251–283.Crossref, Google Scholar
• [38] Sun G, Zhang P, Yu LY, Lin GH (2021) New smoothing merit function for symmetric cone complementarity problems. Pacific J. Optim. 17(4):577–593.Google Scholar
• [39] Tang JY, Zhang HC (2021) A nonmonotone smoothing Newton algorithm for weighted complementarity problem. J. Optim. Theory Appl. 189:679–715.Crossref, Google Scholar
• [40] Tang JY, Zhou JC (2024) Expected residual minimization formulation for stochastic absolute value equations. J. Optim. Theory Appl. 203(1):651–675.Crossref, Google Scholar
• [41] Tang JY, Zhou JC, Zhang HC (2023) An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems. J. Optim. Theory Appl. 196(2):641–665.Crossref, Google Scholar
• [42] Wang GX, Zhang J, Zeng B, Lin GH (2018) Expected residual minimization formulation for a class of stochastic linear second-order cone complementarity problems. Eur. J. Oper. Res. 265(2):437–447.Crossref, Google Scholar
• [43] Xie Y, Shanbhag UV (2016) On robust solutions to uncertain linear complementarity problems and their variants. SIAM J. Optim. 26(4):2020–2159.Crossref, Google Scholar
• [44] Zhao Y, Zhang J, Yang X, Lin GH (2017) Expected residual minimization formulation for a class of stochastic vector variational inequalities. J. Optim. Theory Appl. 175:545–566.Crossref, Google Scholar
• [45] Zhou GL, Caccetta L (2008) Feasible semismooth Newton method for a class of stochastic linear complementarity problems. J. Optim. Theory Appl. 139:379–392.Crossref, Google Scholar