Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Yasushi Narushima"'
Publikováno v:
Results in Control and Optimization, Vol 3, Iss , Pp 100012- (2021)
In this paper, we consider an active-set algorithm for solving large-scale bound constrained optimization problems. First, by incorporating a restart technique, we modify the active-set strategy by Yuan and Lu (2011) and combine it with the memoryles
Externí odkaz:
https://doaj.org/article/ff8ae502184248f3adedeaa3329be551
Publikováno v:
Abstract and Applied Analysis, Vol 2013 (2013)
We deal with complementarity problems over second-order cones. The complementarity problem is an important class of problems in the real world and involves many optimization problems. The complementarity problem can be reformulated as a nonsmooth sys
Externí odkaz:
https://doaj.org/article/2a96519fe8b543b587761055535633e5
Publikováno v:
Journal of Optimization Theory and Applications. 197:639-664
Publikováno v:
Computational Optimization and Applications. 79:127-154
This study considers a proximal Newton-type method to solve the minimization of a composite function that is the sum of a smooth nonconvex function and a nonsmooth convex function. In general, the method uses the Hessian matrix of the smooth portion
Autor:
Yasushi Narushima, Tatsuya Hirano
Publikováno v:
Transportation Science. 53:1196-1212
An important and often researched area of management science is mathematical modeling of a supply chain. Competitive situations can occur in supply chains owing to the involvement of multiple decision makers (players) that independently decide their
Publikováno v:
Journal of Industrial & Management Optimization. 15:1773-1793
Memoryless quasi-Newton methods are studied for solving large-scale unconstrained optimization problems. Recently, memoryless quasi-Newton methods based on several kinds of updating formulas were proposed. Since the methods closely related to the con
Publikováno v:
Journal of the Operations Research Society of Japan. 61:53-70
Publikováno v:
Results in Control and Optimization, Vol 3, Iss, Pp 100012-(2021)
In this paper, we consider an active-set algorithm for solving large-scale bound constrained optimization problems. First, by incorporating a restart technique, we modify the active-set strategy by Yuan and Lu (2011) and combine it with the memoryles
Publikováno v:
Optimization Methods and Software. 32:1313-1329
The conjugate gradient method is an effective method for large-scale unconstrained optimization problems. Recent research has proposed conjugate gradient methods based on secant conditions to estab...
Autor:
Yasushi Narushima
Publikováno v:
IIAI-AAI
In this paper, we inspect whether Yokohama Business Game (YBG) is an effective tool for economic experiments. For this purpose, we develop a game about manufacturing industries by using YBG. By analyzing the results of proposed game by using the evol