This paper considers a class of stochastic variational inequality problems. As proposed by Jiang and Xu （2008）, by using the so-called regularized gap function, the authors formulate the problems as constrained opti...This paper considers a class of stochastic variational inequality problems. As proposed by Jiang and Xu （2008）, by using the so-called regularized gap function, the authors formulate the problems as constrained optimization problems and then propose a sample average approximation method for solving the problems. Under some moderate conditions, the authors investigate the limiting behavior of the optimal values and the optimal solutions of the approximation problems. Finally, some numerical results are reported to show efficiency of the proposed method.展开更多
In this paper, we consider a minimal value problem and obtain an algebraic inequality. As an application, we obtain the optimal concavity of some Hessian operators and then establish the C2 a priori estimate for a cla...In this paper, we consider a minimal value problem and obtain an algebraic inequality. As an application, we obtain the optimal concavity of some Hessian operators and then establish the C2 a priori estimate for a class of prescribed σ2 curvature measure equations.展开更多
In order to tradeoff exploration/exploitation and inspired by cell genetic algorithm a cellshift crossover operator for evolutionary algorithm （EA） is proposed in this paper. The definition domain is divided into n-...In order to tradeoff exploration/exploitation and inspired by cell genetic algorithm a cellshift crossover operator for evolutionary algorithm （EA） is proposed in this paper. The definition domain is divided into n-dimension cubic sub-domains （cell） and each individual locates at an ndimensional cube. Cell-shift crossover first exchanges the cell numbers of the crossover pair if they are in the different cells （exploration） and subsequently shift the first individual from its initial place to the other individual＇s cell place. If they are already in the same cell heuristic crossover （exploitation） is used. Cell-shift/heuristic crossover adaptively executes exploration/exploitation search with the vary of genetic diversity. The cell-shift EA has excellent performance in terms of efficiency and efficacy on ten usually used optimization benchmarks when comparing with the recent well-known FEP evolutionary algorithm.展开更多
基金This research is partly supported by the National Natural Science Foundation of China under Grant Nos. 71171027 and 11071028, the Fundamental Research Funds for the Central Universities under Grant No. DUT11SX11, and the Key Project of the National Natural Science Foundation of China under Grant No. 71031002.
文摘This paper considers a class of stochastic variational inequality problems. As proposed by Jiang and Xu （2008）, by using the so-called regularized gap function, the authors formulate the problems as constrained optimization problems and then propose a sample average approximation method for solving the problems. Under some moderate conditions, the authors investigate the limiting behavior of the optimal values and the optimal solutions of the approximation problems. Finally, some numerical results are reported to show efficiency of the proposed method.
文摘In this paper, we consider a minimal value problem and obtain an algebraic inequality. As an application, we obtain the optimal concavity of some Hessian operators and then establish the C2 a priori estimate for a class of prescribed σ2 curvature measure equations.
文摘In order to tradeoff exploration/exploitation and inspired by cell genetic algorithm a cellshift crossover operator for evolutionary algorithm （EA） is proposed in this paper. The definition domain is divided into n-dimension cubic sub-domains （cell） and each individual locates at an ndimensional cube. Cell-shift crossover first exchanges the cell numbers of the crossover pair if they are in the different cells （exploration） and subsequently shift the first individual from its initial place to the other individual＇s cell place. If they are already in the same cell heuristic crossover （exploitation） is used. Cell-shift/heuristic crossover adaptively executes exploration/exploitation search with the vary of genetic diversity. The cell-shift EA has excellent performance in terms of efficiency and efficacy on ten usually used optimization benchmarks when comparing with the recent well-known FEP evolutionary algorithm.
