Efficient method to compute search directions of infeasible primal-dual path-following interior-point method for large scale block diagonal quadratic programming
Efficient method to compute search directions of infeasible primal-dual path-following interior-point method for large scale block diagonal quadratic programming