
doi: 10.1007/bf01585168
The author modifies the convergence conditions of a ``backtracking'' global Newton method announced in his previous paper [Ser. Discret. Math. Theor. Comput. Sci. 4, 301-307 (1991; Zbl 0753.58004)] making them sharper and easier to apply. A new version of the Kantorovich inequalities is presented that is simple to state and prove. An application is made to the centering problem for polytopes and an algorithm is given for the feasibility problem of linear inequalities.
centering, Analysis of algorithms and problem complexity, analytic centers, global Newton method, Implicit function theorems; global Newton methods on manifolds
centering, Analysis of algorithms and problem complexity, analytic centers, global Newton method, Implicit function theorems; global Newton methods on manifolds
| 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). | 6 | |
| 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). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
