Interior path following primal-dual algorithms. part II: Convex quadratic programming

Mathematical Programming

Volumn 44, Issue 1-3, 1989, Pages 43-66

  Monteiro, Renato D C ^a   Adler, Ilan ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

Author keywords

convex quadratic programming; Interior point methods; Karmarkar's algorithm; logarithmic barrier function; path following; polynomial time algorithms

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; OPTIMIZATION;

CONVEX QUADRATIC PROGRAMMING; INTERIOR POINT METHODS; KARMARKAR'S ALGORITHM; PATH FOLLOWING; POLYNOMIAL TIME ALGORITHMS; PRIMAL-DUAL ALGORITHMS;

MATHEMATICAL PROGRAMMING, NONLINEAR;

EID: 0024665753     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01587076     Document Type: Article

References (10)

1. Fast algorithms for convex quadratic programming and multicommodity flows
2. A new polynomial time algorithm for linear programming
3. A polynomial-time algorithm for a class of linear complemtarity problems
4. Polynomial solvability of convex quadratic programming
5. On complementary pivot theory