Author:
Pirhaji Mohammad,Zangiabadi Maryam,Mansouri Hossien,Nakhaei Ali,Shojaeifard Ali
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Reference23 articles.
1. Karmarkar, N.: New polynomial-time algorithm for linear programming. Combinattorica 4, 373–395 (1984)
2. Nie, J., Yuan, Y.: A predictor-corrector algorithm for QSDP combining Dikin-type and Newton centering steps. Ann. Oper. Res. 103, 115–133 (2001)
3. Toh, K.: An inexact primal-dual path following algorithm for convex quadratic SDP. Math. Program. 112, 221–254 (2008)
4. Xiao, X., Zhang, L., Zhang, J.: A smoothing Newton method for a type of inverse semidefinite quadratic programming problem. J. Comput. Appl. Math. 223, 485–498 (2009)
5. Achache, M., Guerra, L.: A full Nesterov–Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimizationJ. Appl. Math. Comput. 231, 581–590 (2014)