kw.\*:("Large- and small-update methods")
Results 1 to 5 of 5
Selection :
Primal-dual interior-point algorithm for convex quadratic semi-definite optimizationWANG, G. Q; BAI, Y. Q.Nonlinear analysis. 2009, Vol 71, Num 7-8, pp 3389-3402, issn 0362-546X, 14 p.Article
Primal-dual interior-point algorithms for second-order cone optimization based on kernel functionsBAR, Y. Q; WANG, G. Q; ROOS, C et al.Nonlinear analysis. 2009, Vol 70, Num 10, pp 3584-3602, issn 0362-546X, 19 p.Article
A class of polynomial interior-point algorithms for the Cartesian P* (κ) second-order cone linear complementarity problemWANG, G. Q; ZHU, D. T.Nonlinear analysis. 2010, Vol 73, Num 12, pp 3705-3722, issn 0362-546X, 18 p.Article
Polynomial interior-point algorithms for P*(κ) horizontal linear complementarity problemWANG, G. Q; BAI, Y. Q.Journal of computational and applied mathematics. 2009, Vol 233, Num 2, pp 248-263, issn 0377-0427, 16 p.Article
GENERIC PRIMAL-DUAL INTERIOR POINT METHODS BASED ON A NEW KERNEL FUNCTIONEL GHAMI, M; ROOS, C.RAIRO. Recherche opérationnelle. 2008, Vol 42, Num 2, pp 199-213, issn 0399-0559, 15 p.Conference Paper