
doi: 10.19139/21 , 10.19139/soic.v2i1.21
In this paper a new weighted short-step primal-dual interior point algorithm to solve convex quadratic optimization (CQO) problems. The algorithm uses at each interior iteration afull-Newton step and the strategy of the central to obtain an epsilon-optimal solution of CQO. The algorithm yields the best currently best known theoretical complexity bound namely O(\sqrt(n) log n/epsilon).
| 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). | 2 | |
| 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 |
