
doi: 10.1137/0728029
handle: 20.500.11937/91447
The authors consider maximizing a concave quadratic function under convex quadratic constraints: an interior point method is developed. Complexity results are provided.
PRIMAL-DUAL ALGORITHMS, Convex programming, Science & Technology, method of centers, INTERIOR POINT METHODS, analytic center, ANALYTIC CENTER, quadratic programming, Complexity, Quadratic programming, METHOD OF CENTERS, 510, 004, Complexity and performance of numerical algorithms, POLYNOMIAL-TIME ALGORITHM, Numerical mathematical programming methods, KARMARKAR ALGORITHM, Karmarkar's algorithm, Physical Sciences, Applied, interior point method, QUADRATIC PROGRAMMING, Mathematics
PRIMAL-DUAL ALGORITHMS, Convex programming, Science & Technology, method of centers, INTERIOR POINT METHODS, analytic center, ANALYTIC CENTER, quadratic programming, Complexity, Quadratic programming, METHOD OF CENTERS, 510, 004, Complexity and performance of numerical algorithms, POLYNOMIAL-TIME ALGORITHM, Numerical mathematical programming methods, KARMARKAR ALGORITHM, Karmarkar's algorithm, Physical Sciences, Applied, interior point method, QUADRATIC PROGRAMMING, Mathematics
| 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). | 30 | |
| 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. | Top 10% | |
| 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. | Top 10% |
