A primal-infeasible interior point algorithm for linearly constrained convex programming
Wang, Yanjin ; Fei, Pusheng
Control and Cybernetics, Tome 38 (2009), p. 687-704 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)
Publié le : 2009-01-01
EUDML-ID : urn:eudml:doc:209638 
@article{bwmeta1.element.bwnjournal-article-ccv38i3p687bwm,
     author = {Wang, Yanjin and Fei, Pusheng},
     title = {A primal-infeasible interior point algorithm for linearly constrained convex programming},
     journal = {Control and Cybernetics},
     volume = {38},
     year = {2009},
     pages = {687-704},
     zbl = {1301.90099},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-ccv38i3p687bwm}
}

Wang, Yanjin; Fei, Pusheng. A primal-infeasible interior point algorithm for linearly constrained convex programming. Control and Cybernetics, Tome 38 (2009) pp. 687-704. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-ccv38i3p687bwm/