Nobuo Yamashita

36 papers Journal 36

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Convergence analysis of a regularized Newton method with generalized regularization terms for unconstrained convex optimization problems. Appl. Math. Comput. Yuya Yamakawa, Nobuo Yamashita
2024	J	`jnl`	Convergence properties of Levenberg-Marquardt methods with generalized regularization terms. Appl. Math. Comput. Shumpei Ariizumi, Yuya Yamakawa, Nobuo Yamashita
2023	J	`jnl`	An accelerated proximal gradient method for multiobjective optimization. Comput. Optim. Appl. Hiroki Tanabe, Ellen H. Fukuda, Nobuo Yamashita
2023	J	`jnl`	An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs. Optim. Methods Softw. Yuya Yamakawa, Tetsuya Ikegami, Ellen H. Fukuda, Nobuo Yamashita
2023	J	`jnl`	Convergence analysis and acceleration of the smoothing methods for solving extensive-form games. CoRR Keigo Habara, Ellen Hidemi Fukuda, Nobuo Yamashita
2023	J	`jnl`	Convergence rates analysis of a multiobjective proximal gradient method. Optim. Lett. Hiroki Tanabe, Ellen H. Fukuda, Nobuo Yamashita
2023	J	`jnl`	Distributionally robust expected residual minimization for stochastic variational inequality problems. Optim. Methods Softw. Atsushi Hori, Yuya Yamakawa, Nobuo Yamashita
2022	J	`jnl`	A Stochastic Variance Reduced Gradient using Barzilai-Borwein Techniques as Second Order Information. CoRR Hardik Tankaria, Nobuo Yamashita
2022	J	`jnl`	A globally convergent fast iterative shrinkage-thresholding algorithm with a new momentum factor for single and multi-objective convex optimization. CoRR Hiroki Tanabe, Ellen H. Fukuda, Nobuo Yamashita
2022	J	`jnl`	A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations. Comput. Optim. Appl. Hardik Tankaria, Shinji Sugimoto, Nobuo Yamashita
2022	J	`jnl`	An accelerated proximal gradient method for multiobjective optimization. CoRR Hiroki Tanabe, Ellen H. Fukuda, Nobuo Yamashita
2021	J	`jnl`	A Regularized Limited Memory BFGS method for Large-Scale Unconstrained Optimization and its Efficient Implementations. CoRR Hardik Tankaria, Shinji Sugimoto, Nobuo Yamashita
2021	J	`jnl`	An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization. Comput. Appl. Math. Yan Gu, Nobuo Yamashita
2019	J	`jnl`	Augmented Lagrangian Method with Alternating Constraints for Nonlinear Optimization Problems. J. Optim. Theory Appl. Siti Nor Habibah Binti Hassan, Tomohiro Niimi, Nobuo Yamashita
2019	J	`jnl`	Nonmonotone line searches for unconstrained multiobjective optimization problems. J. Glob. Optim. Kanako Mita, Ellen H. Fukuda, Nobuo Yamashita
2019	J	`jnl`	Proximal gradient methods for multiobjective optimization and their applications. Comput. Optim. Appl. Hiroki Tanabe, Ellen H. Fukuda, Nobuo Yamashita
2018	J	`jnl`	Duality of nonconvex optimization with positively homogeneous functions. Comput. Optim. Appl. Shota Yamanaka, Nobuo Yamashita
2017	J	`jnl`	Erratum to: A regularized Newton method without line search for unconstrained optimization. Comput. Optim. Appl. Kenji Ueda, Nobuo Yamashita
2016	J	`jnl`	An exchange method with refined subproblems for convex semi-infinite programming problems. Optim. Methods Softw. Takayuki Okuno, Shunsuke Hayashi, Nobuo Yamashita, Kensuke Gomoto
2016	J	`jnl`	Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization. Math. Program. Xiaoqin Hua, Nobuo Yamashita
2015	J	`jnl`	Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization. SIAM J. Optim. Xiaoqin Hua, Nobuo Yamashita
2014	J	`jnl`	A regularized Newton method without line search for unconstrained optimization. Comput. Optim. Appl. Kenji Ueda, Nobuo Yamashita
2014	J	`jnl`	Preface. Comput. Optim. Appl. Xiaojun Chen, Nobuo Yamashita
2012	J	`jnl`	Global Complexity Bound Analysis of the Levenberg-Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem. J. Optim. Theory Appl. Kenji Ueda, Nobuo Yamashita
2010	J	`jnl`	On a Global Complexity Bound of the Levenberg-Marquardt Method. J. Optim. Theory Appl. Kenji Ueda, Nobuo Yamashita
2008	J	`jnl`	Sparse quasi-Newton updates with positive definite matrix completion. Math. Program. Nobuo Yamashita
2005	J	`jnl`	A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems. SIAM J. Optim. Shunsuke Hayashi, Nobuo Yamashita, Masao Fukushima
2004	J	`jnl`	A nonlinear complementarity approach to multiuser power control for digital subscriber lines. Optim. Methods Softw. Nobuo Yamashita, Zhi-Quan Luo
2004	J	`jnl`	On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm. Math. Program. Nobuo Yamashita, Hiroshige Dan, Masao Fukushima
2004	J	`jnl`	Regularized Newton Methods for Convex Minimization Problems with Singular Solutions. Comput. Optim. Appl. Dong-Hui Li, Masao Fukushima, Liqun Qi, Nobuo Yamashita
2003	J	`jnl`	The Incremental Gauss-Newton Algorithm with Adaptive Stepsize Rule. Comput. Optim. Appl. Hiroyuki Moriyama, Nobuo Yamashita, Masao Fukushima
2002	J	`jnl`	A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions. Math. Oper. Res. Hiroshige Dan, Nobuo Yamashita, Masao Fukushima
2002	J	`jnl`	Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions. Optim. Methods Softw. Hiroshige Dan, Nobuo Yamashita, Masao Fukushima
2000	J	`jnl`	The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem. SIAM J. Optim. Nobuo Yamashita, Masao Fukushima
1996	J	`jnl`	Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach. SIAM J. Optim. Paul Tseng, Nobuo Yamashita, Masao Fukushima
1996	J	`jnl`	Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems. Math. Program. Nobuo Yamashita, Masao Fukushima