An extension of Karmarkar's projective algorithm for convex quadratic programming
- 1 May 1989
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 44 (1-3), 157-179
- https://doi.org/10.1007/bf01587086
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A monotonic projective algorithm for fractional linear programmingAlgorithmica, 1986
- A variation on Karmarkar’s algorithm for solving linear programming problemsMathematical Programming, 1986
- Fast algorithms for convex quadratic programming and multicommodity flowsPublished by Association for Computing Machinery (ACM) ,1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Newton-type methods for unconstrained and linearly constrained optimizationMathematical Programming, 1974
- On the basic theorem of complementarityMathematical Programming, 1971
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- On quadratic prorammingNaval Research Logistics Quarterly, 1959
- A quadratic programming procedureNaval Research Logistics Quarterly, 1957