
For the unconstrained optimization problem \[ \min f(x),\;x\in\mathbb{R}^n \] a dimension-reducing numerical method is presented. The authors give for this method numerical applications and compare the obtained numerical result with conjugate gradient and variable metric methods.
Numerical methods based on nonlinear programming, variable metric methods, Imprecise gradient values, Applied Mathematics, dimension-reducing numerical method, comparison of methods, Unconstrained optimization, Quadratic convergence, Dimension-reducing method, Computational Mathematics, Numerical mathematical programming methods, Nonlinear programming, conjugate gradient method, Reduction to one-dimensional equations, unconstrained optimization, Bisection method
Numerical methods based on nonlinear programming, variable metric methods, Imprecise gradient values, Applied Mathematics, dimension-reducing numerical method, comparison of methods, Unconstrained optimization, Quadratic convergence, Dimension-reducing method, Computational Mathematics, Numerical mathematical programming methods, Nonlinear programming, conjugate gradient method, Reduction to one-dimensional equations, unconstrained optimization, Bisection method
| 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). | 11 | |
| 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 |
