Projected trust region method for stochastic linear complementarity problems
نویسندگان
چکیده
منابع مشابه
A Projected Algebraic Multigrid Method for Linear Complementarity Problems
We present an algebraic version of an iterative multigrid method for obstacle problems, called projected algebraic multigrid (PAMG) here. We show that classical algebraic multigrid algorithms can easily be extended to deal with this kind of problem. This paves the way for efficient multigrid solution of obstacle problems with partial differential equations arising, for example, in financial eng...
متن کاملSmoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
A smoothing projected gradient (SPG) method is proposed for the minimization problem on a closed convex set, where the objective function is locally Lipschitz continuous but nonconvex, nondifferentiable. We show that any accumulation point generated by the SPG method is a stationary point associated with the smoothing function used in the method, which is a Clarke stationary point in many appli...
متن کاملExpected Residual Minimization Method for Stochastic Linear Complementarity Problems
This paper presents a new formulation for the stochastic linear complementarity problem (SLCP), which aims at minimizing an expected residual defined by an NCP function. We generate observations by the quasi-Monte Carlo methods and prove that every accumulation point of minimizers of discrete approximation problems is a minimum expected residual solution of the SLCP. We show that a sufficient c...
متن کاملProjected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
A reformulation of the mixed complementarity problem as a box constrained overdetermined system of semismooth equations or, equivalently, a box constrained nonlinear least squares problem with zero residual is presented. Based on this reformulation, a trust region method for the solution of mixed complementarity problems is considered. This trust region method contains elements from different a...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ScienceAsia
سال: 2018
ISSN: 1513-1874
DOI: 10.2306/scienceasia1513-1874.2018.44.454