Robust Solutions to a System of Stochastic Vertical Linear Complementarity Problems

References

• [1] Attouch H, Bolte J (2009) On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Programming 116(1–2):5–16.Crossref, Google Scholar
• [2] Attouch H, Bolte J, Svaiter BF (2013) Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Programming 137(1):91–129.Crossref, Google Scholar
• [3] Attouch H, Bolte J, Redont P, Soubeyran A (2010) Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-Łojasiewicz inequality. Math. Oper. Res. 35(2):438–457.Link, Google Scholar
• [4] Ben-Tal A, Den Hertog D, De Waegenaere A, Melenberg B, Rennen G (2013) Robust solutions of optimization problems affected by uncertain probabilities. Management Sci. 59(2):341–357.Link, Google Scholar
• [5] Best MJ, Grauer RR (1991) On the sensitivity of mean-variance-efficient portfolios to changes in asset means: Some analytical and computational results. Rev. Financial Stud. 4(2):315–342.Crossref, Google Scholar
• [6] Bochnak J, Coste M, Roy MF (1998) Real Algebraic Geometry (Springer-Verlag, Berlin).Crossref, Google Scholar
• [7] Bolte J, Daniilidis A, Lewis A (2007) The Łojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4):1205–1223.Crossref, Google Scholar
• [8] Bolte J, Daniilidis A, Lewis A, Shiota M (2007) Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2):556–572.Crossref, Google Scholar
• [9] Burke JV, Chen X, Sun H (2020) The subdifferential of measurable composite max integrands and smoothing approximation. Math. Programming 181(2):229–264.Crossref, Google Scholar
• [10] Chen X (2012) Smoothing methods for nonsmooth, nonconvex minimization. Math. Programming 134(1):71–99.Crossref, Google Scholar
• [11] Chen B, Chen X (1999) A global and local superlinear continuation-smoothing method for p0 and r0 NCP or monotone NCP. SIAM J. Optim. 18(2):556–572.Google Scholar
• [12] Chen X, Lu Z, Pong TK (2016) Penalty methods for a class of non-Lipschitz optimization problems. SIAM J. Optim. 26(3):1465–1492.Crossref, Google Scholar
• [13] Chen X, Sun H, Xu H (2019) Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems. Math. Programming 177(1):255–289.Crossref, Google Scholar
• [14] Clarke FH (1990) Optimization and Nonsmooth Analysis (SIAM, Philadephia).Crossref, Google Scholar
• [15] Cottle RW, Pang JS, Stone RE (2009) The Linear Complementarity Problem (SIAM, Philadephia).Crossref, Google Scholar
• [16] Cui S, Shanbhag UV, Yousefian F (2023) Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs. Math. Programming 198(2):1153–1225.Crossref, Google Scholar
• [17] DeMiguel V, Garlappi L, Uppal R (2009) Optimal versus naive diversification: How inefficient is the 1/N portfolio strategy? Rev. Financial Stud. 22(5):1915–1953.Crossref, Google Scholar
• [18] Gotoh J, Kim MJ, Lim AE (2021) Calibration of distributionally robust empirical optimization models. Oper. Res. 69(5):1630–1650.Link, Google Scholar
• [19] Gowda MS (1996) On the extended linear complementarity problem. Math. Programming 72(1):33–50.Crossref, Google Scholar
• [20] Le Thi HA, Pham Dinh T, Ngai HV (2012) Exact penalty and error bounds in DC programming. J. Global Optim. 52(3):509–535.Crossref, Google Scholar
• [21] Li G, Pong TK (2018) Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods. Foundations Comput. Math. 18(5):1199–1232.Crossref, Google Scholar
• [22] Lin GH, Chen X, Fukushima M (2009) Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization. Math. Programming 116(1):343–368.Crossref, Google Scholar
• [23] Mangasarian OL (1997) Solution of general linear complementarity problems via nondifferentiable concave minimization. Acta Math. Vietnamica 22:199–205.Google Scholar
• [24] Markowitz H (1952) Portfolio selection. J. Finance 7(1):77–91.Google Scholar
• [25] Patriksson M, Wynter L (1999) Stochastic mathematical programs with equilibrium constraints. Oper. Res. Lett. 25(4):159–167.Crossref, Google Scholar
• [26] Rockafellar RT, Wets RJB (1998) Variational Analysis (Springer, New York).Crossref, Google Scholar
• [27] Shapiro A, Xu H (2008) Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation. Optimization 57(3):395–418.Crossref, Google Scholar
• [28] Sun H, Chen X (2021) Two-stage stochastic variational inequalities: Theory, algorithms and applications. J. Oper. Res. Soc. China 9(1):1–32.Crossref, Google Scholar
• [29] Xu Y, Yin W (2013) A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imaging Sci. 6(3):1758–1789.Crossref, Google Scholar
• [30] Xu Y, Yin W (2017) A globally convergent algorithm for nonconvex optimization based on block coordinate update. J. Sci. Comput. 72(2):700–734.Crossref, Google Scholar
• [31] Zhang C, Chen X, Sumalee A (2011) Robust Wardrop’s user equilibrium assignment under stochastic demand and supply: Expected residual minimization approach. Transportation Res. Part B: Methodological 45(3):534–552.Crossref, Google Scholar