Parallel algorithms for unconstrained optimization
H. Mukai;
Parallel algorithms for unconstrained optimization
In this paper, parallel algorithms are proposed for locating the minimum point of a strictly convex quadratic function. The proposed algorithms are based on a new idea of group conjugacy and they can be considered parallel extensions of conjugate direction methods.
- University of Mary United States
- Washington University in St. Louis United States
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).8 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
citations
Citations provided by BIP!
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 8
Average
Top 10%
Average
Fields of Science
This action will publish the selected files and record in Zenodo. Are you sure you want to proceed?