Publication | Closed Access

An O(n 3 L) primal interior point algorithm for convex quadratic programming

Mathematical ProgrammingEngineeringConvex OptimizationN 3Computational ComplexityInterior Point AlgorithmSemidefinite ProgrammingDiscrete MathematicsLinear ProgrammingCombinatorial OptimizationComputational GeometryApproximation TheoryConvex Quadratic ProgrammingQuadratic Programming