Old Web
English
Sign In
Acemap
>
Paper
>
THE GLOBAL COMPLEXITY BOUNDS OF THE GRADIENT METHODS AND THE NEWTON-TYPE METHODS FOR THE UNCONSTRAINED MINIMIZATION PROBLEM
THE GLOBAL COMPLEXITY BOUNDS OF THE GRADIENT METHODS AND THE NEWTON-TYPE METHODS FOR THE UNCONSTRAINED MINIMIZATION PROBLEM
2013
Nobuo Yamashita
Kenji Ueda
Keywords:
Mathematical optimization
Discrete mathematics
Mathematics
minimization problem
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]