Zobrazeno 1 - 10
of 159
pro vyhledávání: '"Hiroshi Yabe"'
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:
Journal of Optimization Theory and Applications. 197:639-664
Publikováno v:
Journal of the Society of Materials Science, Japan. 71:73-78
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
Publikováno v:
Optimization Methods and Software. 36:569-601
In this paper, we propose a primal-dual interior point trust-region method for solving nonlinear semidefinite programming problems. The method consists of the outer iteration (SDPIP) that finds a K...
Publikováno v:
Proceedings of the 4th International Conference on Performance Based Design in Earthquake Geotechnical Engineering (Beijing 2022) ISBN: 9783031118975
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2d7b48cc61902764fc32b92b3766bd7
https://doi.org/10.1007/978-3-031-11898-2_103
https://doi.org/10.1007/978-3-031-11898-2_103
Autor:
HIROSHI, YABE
Publikováno v:
理大科学フォーラム : 東京理科大学科学教養誌. 36(3):12-15
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