
doi: 10.2172/432433
We consider a modification of a path-following infeasible-interior- point algorithm described by Wright. In the new algorithm, we attempt to improve each new iterate by reusing the coefficient matrix factors from the latest step. We show that the modified algorithm has similar theoretical global convergence properties to the earlier algorithm, while its asymptotic convergence rate can be made superquadratic by an appropriate parameter choice.
Computers, Convergence, Iterative Methods, 99 Mathematics, Law, Information Science, Mathematics, Algorithms, Management, Miscellaneous
Computers, Convergence, Iterative Methods, 99 Mathematics, Law, Information Science, Mathematics, Algorithms, Management, Miscellaneous
| 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). | 3 | |
| 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 |
