default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYasushi Narushima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j15]Shummin Nakayama
, Yasushi Narushima, Hiroshi Yabe:
Inexact proximal DC Newton-type method for nonconvex composite functions. Comput. Optim. Appl. 87(2): 611-640 (2024)- 2023
- [j14]Yasushi Narushima, Shummin Nakayama, Masashi Takemura, Hiroshi Yabe:
Memoryless Quasi-Newton Methods Based on the Spectral-Scaling Broyden Family for Riemannian Optimization. J. Optim. Theory Appl. 197(2): 639-664 (2023) - 2021
- [j13]Shummin Nakayama, Yasushi Narushima, Hiroshi Yabe:
Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions. Comput. Optim. Appl. 79(1): 127-154 (2021) - 2019
- [j12]Tatsuya Hirano, Yasushi Narushima:
Robust Supply Chain Network Equilibrium Model. Transp. Sci. 53(4): 1196-1212 (2019) - 2017
- [j11]Hiroshi Kobayashi, Yasushi Narushima, Hiroshi Yabe:
Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization. Optim. Methods Softw. 32(6): 1313-1329 (2017) - 2015
- [j10]Mehiddin Al-Baali, Yasushi Narushima, Hiroshi Yabe:
A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization. Comput. Optim. Appl. 60(1): 89-110 (2015) - 2013
- [j9]Yasushi Narushima:
A smoothing conjugate gradient method for solving systems of nonsmooth equations. Appl. Math. Comput. 219(16): 8646-8655 (2013) - 2012
- [j8]Yasushi Narushima, Hiroshi Yabe:
Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization. J. Comput. Appl. Math. 236(17): 4303-4317 (2012) - [j7]Kaori Sugiki, Yasushi Narushima, Hiroshi Yabe:
Globally Convergent Three-Term Conjugate Gradient Methods that Use Secant Conditions and Generate Descent Search Directions for Unconstrained Optimization. J. Optim. Theory Appl. 153(3): 733-757 (2012) - [j6]Hideaki Iiduka, Yasushi Narushima:
Conjugate gradient methods using value of objective function for unconstrained optimization. Optim. Lett. 6(5): 941-955 (2012) - 2011
- [j5]Yasushi Narushima, Nobuko Sagara, Hideho Ogasawara:
A Smoothing Newton Method with Fischer-Burmeister Function for Second-Order Cone Complementarity Problems. J. Optim. Theory Appl. 149(1): 79-101 (2011) - [j4]Yasushi Narushima, Hiroshi Yabe, John A. Ford:
A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization. SIAM J. Optim. 21(1): 212-230 (2011) - 2010
- [j3]Michiya Kobayashi, Yasushi Narushima, Hiroshi Yabe:
Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems. J. Comput. Appl. Math. 234(2): 375-397 (2010) - 2008
- [j2]John A. Ford, Yasushi Narushima, Hiroshi Yabe:
Multi-step nonlinear conjugate gradient methods for unconstrained minimization. Comput. Optim. Appl. 40(2): 191-216 (2008) - 2006
- [j1]Yasushi Narushima, Hiroshi Yabe:
Global Convergence of a Memory Gradient Method for Unconstrained Optimization. Comput. Optim. Appl. 35(3): 325-346 (2006)
Conference and Workshop Papers
- 2017
- [c1]Yasushi Narushima:
Economic Experiments in YBG: The Case of Manufacturing Industry Game. IIAI-AAI 2017: 937-940
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
