SAA method based on modified Newton method for stochastic variational inequality with second-order cone constraints and application in portfolio optimization
DOI10.1007/S00186-016-0537-1zbMATH Open1414.91334OpenAlexW2320451501MaRDI QIDQ328526FDOQ328526
Dan Li, Xue-Fei Ma, Shuang Chen, Li-Ping Pang
Publication date: 20 October 2016
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-016-0537-1
portfolio optimizationstochastic programmingconic programmingstochastic variational inequality problem
Numerical methods (including Monte Carlo methods) (91G60) Portfolio theory (91G10) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions
- The empirical behavior of sampling methods for stochastic programming
- The sample average approximation method for stochastic discrete optimization
- SAMPLE AVERAGE APPROXIMATION METHODS FOR A CLASS OF STOCHASTIC VARIATIONAL INEQUALITY PROBLEMS
- On the convergence of coderivative of SAA solution mapping for a parametric stochastic variational inequality
- Stochastic Approximation Approaches to the Stochastic Variational Inequality Problem
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Smoothing functions for second-order-cone complementarity problems
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions
- Stochastic second-order cone programming in mobile ad hoc networks
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Lectures on stochastic programming. Modeling and theory.
- Sample-path solution of stochastic variational inequalities
- A penalized Fischer-Burmeister NCP-function
- Quantitative Stability Analysis of Stochastic Generalized Equations
- A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems
Uses Software
Recommendations
- Title not available (Why is that?) π π
- Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions π π
- Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization π π
- A regularization SAA scheme for a stochastic mathematical program with complementarity constraints π π
- An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems π π
- Convergence analysis of a smoothing SAA method for a stochastic mathematical program with second-order cone complementarity constraints π π
- Asymptotic convergence of stationary points of stochastic multiobjective programs with parametric variational inequality constraint via SAA approach π π
- A class of smoothing SAA methods for a stochastic mathematical program with complementarity constraints π π
- Stochastic programming with multivariate second order stochastic dominance constraints with applications in portfolio optimization π π
- A new model for solving stochastic second-order cone complementarity problem and its convergence analysis π π
This page was built for publication: SAA method based on modified Newton method for stochastic variational inequality with second-order cone constraints and application in portfolio optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328526)