Geodesic
A primal-infeasible interior point algorithm for linearly constrained convex programming
Control and Cybernetics, Tome 38 (2009) no. 3, pp. 687-704 Cet article a éte moissonné depuis la source The Polish Digital Mathematics Library

Voir la notice de l'article

@article{CC_2009_38_3_a8,
     author = {Wang, Yanjin and Fei, Pusheng},
     title = {A primal-infeasible interior point algorithm for linearly constrained convex programming},
     journal = {Control and Cybernetics},
     pages = {687--704},
     year = {2009},
     volume = {38},
     number = {3},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CC_2009_38_3_a8/}
}
TY  - JOUR
AU  - Wang, Yanjin
AU  - Fei, Pusheng
TI  - A primal-infeasible interior point algorithm for linearly constrained convex programming
JO  - Control and Cybernetics
PY  - 2009
SP  - 687
EP  - 704
VL  - 38
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/CC_2009_38_3_a8/
LA  - en
ID  - CC_2009_38_3_a8
ER  - 
%0 Journal Article
%A Wang, Yanjin
%A Fei, Pusheng
%T A primal-infeasible interior point algorithm for linearly constrained convex programming
%J Control and Cybernetics
%D 2009
%P 687-704
%V 38
%N 3
%U http://geodesic.mathdoc.fr/item/CC_2009_38_3_a8/
%G en
%F CC_2009_38_3_a8
Wang, Yanjin; Fei, Pusheng. A primal-infeasible interior point algorithm for linearly constrained convex programming. Control and Cybernetics, Tome 38 (2009) no. 3, pp. 687-704. http://geodesic.mathdoc.fr/item/CC_2009_38_3_a8/