As is obvious from these tables, the proposed algorithm allows problem (4), (6) to be solved fairly fast. At the same time, it depends weakly both on the dimensions of the problem and on the required precision of solu...
详细信息
programming story problems requires an understanding of the requirements of the problem statement and how to write source code that satisfies them. However, some learners are unable to write source code that meets the...
详细信息
ISBN:
(纸本)9783031601248;9783031601255
programming story problems requires an understanding of the requirements of the problem statement and how to write source code that satisfies them. However, some learners are unable to write source code that meets the requirements of the problem statement. Therefore, we modeled the problem-solving process in programming story problems. The problem-solving process begins by organizing the information in the context of the problem statement, thinking through the abstract operations necessary to find a solution, and defining the solution. In this study, we propose a learning support method and develop a learning support system that follows this problem-solving process.
作者：
Bai, Zhong-ZhiTao, MinChinese Acad Sci
Acad Math & Syst Sci Inst Computat Math & Sci Engn Comp State Key Lab Sci Engn Comp POB 2719 Beijing 100190 Peoples R China Univ Chinese Acad Sci
Sch Math Sci Beijing 100049 Peoples R China Nanjing Univ
Dept Math Nanjing 210008 Jiangsu Peoples R China
To iteratively compute a solution of the equality-constraint quadratic programming problem, by successively introducing relaxation parameters and skillfully adopting a preconditioning matrix, we establish a preconditi...
详细信息
To iteratively compute a solution of the equality-constraint quadratic programming problem, by successively introducing relaxation parameters and skillfully adopting a preconditioning matrix, we establish a preconditioned and relaxed alternating variable minimization with multiplier (PRAVMM) method, which is a further generalization of the preconditioned alternating variable minimization with multiplier (PAVMM) method proposed by Bai and Tao (2016) (BIT Numer. Math. 56 (2016), 399-422). Based on rigorous matrix analysis we demonstrate the asymptotic convergence property of the PRAVMM method. Numerical results show that the PRAVMM method is feasible and effective for solving the equality-constraint quadratic programming problems. (C) 2016 Elsevier Inc. All rights reserved.
Two numerical examples are presented, and it is shown that, if the initial multiplier is chosen optimally, modified quasilinearization converges to the solution. On the other hand, if the initial multiplier is chosen ...
详细信息
Two numerical examples are presented, and it is shown that, if the initial multiplier is chosen optimally, modified quasilinearization converges to the solution. On the other hand, if the initial multiplier is chosen arbitrarily modified quasilinearization may or may not converge to the solution. From the examples, it is concluded that the beneficial effect associated with the optimal initial choice of the multiplier lies primarily in increasing the likelihood of convergence rather than accelerating convergence.
In this paper, we extend the application of exponential penalty function method for solving multiobjective programming problem introduced by Liu and Feng (2010) to solve multiobjective fractional programming problem a...
详细信息
In this paper, we extend the application of exponential penalty function method for solving multiobjective programming problem introduced by Liu and Feng (2010) to solve multiobjective fractional programming problem and analyze the relationship between weak efficient solutions of penalized problems and multiobjective fractional programming problem. Furthermore, we examine the convergence of this method for multiobjective fractional programming problems. (C) 2014 Production and hosting by Elsevier B.V. on behalf of Ain Shams University.
暂无评论