On affine scaling algorithms for nonconvex quadratic programming
- 1 August 1992
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 56 (1-3) , 285-300
- https://doi.org/10.1007/bf01580903
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- An O(n 3 L) primal interior point algorithm for convex quadratic programmingMathematical Programming, 1990
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic OperationsMathematics of Operations Research, 1990
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- Homotopy method for generalized eigenvalue problems Ax= ΛBxLinear Algebra and its Applications, 1987
- 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
- Computing Optimal Locally Constrained StepsSIAM Journal on Scientific and Statistical Computing, 1981
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- Maximization by Quadratic Hill-ClimbingEconometrica, 1966