In this paper we study L-shaped convex programming. An algorithm for it is given. The result of computation shows that the algorithm is effective. The algorithm can be applied to two stage problem of stochastic convex...In this paper we study L-shaped convex programming. An algorithm for it is given. The result of computation shows that the algorithm is effective. The algorithm can be applied to two stage problem of stochastic convex programming.展开更多
Let Ω be a smoothly bounded convex domain of finite type in Cn,Ω be the boundary of Ω, S α(f) and g(f) be the area integral and Littlewood-Paley g-function on Ω,respectively. If f ∈ BMOA,then S α(f) < ∞ a.e...Let Ω be a smoothly bounded convex domain of finite type in Cn,Ω be the boundary of Ω, S α(f) and g(f) be the area integral and Littlewood-Paley g-function on Ω,respectively. If f ∈ BMOA,then S α(f) < ∞ a.e. on Ω,and there exists a constant C such that Sα(f) ‖*≤ C ‖f‖*. The same result also holds for g(f).展开更多
基金This work is supported by Science Research Foundation (20262250) of the Education Department of Liaoning Province.
文摘In this paper we study L-shaped convex programming. An algorithm for it is given. The result of computation shows that the algorithm is effective. The algorithm can be applied to two stage problem of stochastic convex programming.
基金supported by Natural Science Foundation of Fujian Province (Grant No. 2009J01004)
文摘Let Ω be a smoothly bounded convex domain of finite type in Cn,Ω be the boundary of Ω, S α(f) and g(f) be the area integral and Littlewood-Paley g-function on Ω,respectively. If f ∈ BMOA,then S α(f) < ∞ a.e. on Ω,and there exists a constant C such that Sα(f) ‖*≤ C ‖f‖*. The same result also holds for g(f).
