Publication | Closed Access

Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier

Numerical AnalysisMathematical ProgrammingEngineeringPrimal-dual Interior-point MethodsConvex OptimizationSemidefinite ProgrammingLinear ProgrammingFinite BarrierApproximation TheoryConvex Quadratic OptimizationQuadratic Programming