Yasushi Narushima
Orcid: 0000-0003-4740-5796
According to our database1,
Yasushi Narushima
authored at least 16 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Comput. Optim. Appl., March, 2024
2023
Memoryless Quasi-Newton Methods Based on the Spectral-Scaling Broyden Family for Riemannian Optimization.
J. Optim. Theory Appl., May, 2023
2021
Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions.
Comput. Optim. Appl., 2021
2019
2017
Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization.
Optim. Methods Softw., 2017
Proceedings of the 6th IIAI International Congress on Advanced Applied Informatics, 2017
2015
A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization.
Comput. Optim. Appl., 2015
2013
Appl. Math. Comput., 2013
2012
Conjugate gradient methods using value of objective function for unconstrained optimization.
Optim. Lett., 2012
Globally Convergent Three-Term Conjugate Gradient Methods that Use Secant Conditions and Generate Descent Search Directions for Unconstrained Optimization.
J. Optim. Theory Appl., 2012
Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization.
J. Comput. Appl. Math., 2012
2011
A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization.
SIAM J. Optim., 2011
A Smoothing Newton Method with Fischer-Burmeister Function for Second-Order Cone Complementarity Problems.
J. Optim. Theory Appl., 2011
2010
Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems.
J. Comput. Appl. Math., 2010
2008
Comput. Optim. Appl., 2008
2006
Comput. Optim. Appl., 2006