SAA method based on modified Newton method for stochastic variational inequality with second-order cone constraints and application in portfolio optimization

In this paper we apply modified Newton method based on sample average approximation (SAA) to solve stochastic variational inequality with stochastic second-order cone constraints (SSOCCVI). Under some moderate conditions, the SAA solution converges to its true counterpart with probability approaching one at exponential rate as sample size increases. We apply the theoretical results for solving a class of stochastic second order cone complementarity problems and stochastic programming problems with stochastic second order cone constraints. Some illustrative examples are given to show how the globally convergent method works and the comparison results between our method and other methods. Furthermore, we apply this method to portfolio optimization with loss risk constraints problems.

[1]  Houyuan Jiang,et al.  Stochastic Approximation Approaches to the Stochastic Variational Inequality Problem , 2008, IEEE Transactions on Automatic Control.

[2]  Gül Gürkan,et al.  Sample-path solution of stochastic variational inequalities , 1999, Math. Program..

[3]  Alexander Shapiro,et al.  The empirical behavior of sampling methods for stochastic programming , 2006, Ann. Oper. Res..

[4]  Masao Fukushima,et al.  Smoothing Functions for Second-Order-Cone Complementarity Problems , 2002, SIAM J. Optim..

[5]  C. Kanzow,et al.  A Penalized Fischer-Burmeister Ncp-Function: Theoretical Investigation And Numerical Results , 1997 .

[6]  Defeng Sun,et al.  Complementarity Functions and Numerical Experiments on Some Smoothing Newton Methods for Second-Order-Cone Complementarity Problems , 2003, Comput. Optim. Appl..

[7]  Jein-Shan Chen,et al.  A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions , 2010, Comput. Optim. Appl..

[8]  Elisabetta Allevi,et al.  Stochastic Second-Order Cone Programming in Mobile Ad Hoc Networks , 2009 .

[9]  Liwei Zhang,et al.  A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems , 2009, Comput. Math. Appl..

[10]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[11]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[12]  Jie Zhang,et al.  On the Convergence of Coderivative of SAA Solution Mapping for a Parametric Stochastic Variational Inequality , 2012 .

[13]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[14]  Zun-Quan Xia,et al.  Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions , 2012, Math. Comput. Model..

[15]  Huifu Xu,et al.  Sample Average Approximation Methods for a Class of Stochastic Variational inequality Problems , 2010, Asia Pac. J. Oper. Res..

[16]  Alexander Shapiro,et al.  On Complexity of Stochastic Programming Problems , 2005 .

[17]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[18]  David P. Morton,et al.  Monte Carlo bounding techniques for determining solution quality in stochastic programs , 1999, Oper. Res. Lett..

[19]  Yongchao Liu,et al.  Quantitative Stability Analysis of Stochastic Generalized Equations , 2014, SIAM J. Optim..

[20]  Alexander Shapiro,et al.  Lectures on Stochastic Programming - Modeling and Theory, Second Edition , 2014, MOS-SIAM Series on Optimization.