Search

We consider the incremental subgradient algorithm employing dynamic step sizes for minimizing the sum of a large number of component convex functions. The dynamic step size rule was firstly introduced by Goffin and Kiwiel [Math. Program., 1999, 85(1): 207‐211] for the subgradient algorithm, soon later, for the incremental subgradient algorithm by Nedic and Bertsekas in [SIAM J. Optim., 2001, 12(1): 109‐138]. It was observed experimentally that the incremental approach has been very successful in solving large separable optimizations and that the dynamic step sizes generally have better computational performance than others in the literature. In the present paper, we propose two modified dynamic step size rules for the incremental subgradient algorithm and analyse the convergence and complexity properties of them. At last, the assignment problem is considered and the incremental subgradient algorithms employing different kinds of dynamic step sizes are applied to solve the problem. The computational experiments show that the two modified ones converges dramatically faster and more stable than the corresponding one in [SIAM J. Optim., 2001, 12(1): 109‐138]. Particularly, for solving large separable convex optimizations, we strongly recommend the second one (see Algorithm 3.3 in the paper) since it has interesting computational performance and is the simplest one. [ABSTRACT FROM AUTHOR]

Online game addiction has become a large problem worldwide, and it could give negative impacts on children in many ways such as physical health, learning, emotion, and behavior. Online game addiction is mostly found in children and youth at the age of 15 to 24 years. Therefore, in this paper, we have developed a mathematical model of online game addiction to explore the effects of education campaign and family understanding on online game addiction in Thailand. Analysis of this model reveals two main equilibria, addiction‐free (AFE) and addiction‐present (APE) ones. Results show that the AFE is locally asymptotically stable when the value of basic reproduction number (R0) is less than the unity; otherwise, there is a unique endemic equilibrium point, and it is locally stable when satisfies the Routh‐Hurwitz criterion. Further, the conditions of AFE to be globally stable are demonstrated. Finally, the results of sensitivity analysis and numerical simulation show that the effectiveness of both education campaign and family understanding is an important factor in reducing the value of R0 and holds great promise for lowering the number of children and youth who addict to online game in Thailand. [ABSTRACT FROM AUTHOR]