
doi: 10.1007/bf02238081
A combination of quasi-Newton methods with conic functions for solving unconstrained optimization problems is described. The method is q- superlinearly convergent, and decreases the number of line searches. Numerical examples show that the new method is successful.
quasi-Newton methods, numerical examples, conic functions, Numerical mathematical programming methods, Nonlinear programming, conic model, unconstrained optimization, q-superlinear convergence, line searches
quasi-Newton methods, numerical examples, conic functions, Numerical mathematical programming methods, Nonlinear programming, conic model, unconstrained optimization, q-superlinear convergence, line searches
| selected citations These citations are derived from selected sources. 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). | 17 | |
| 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 |
