A primal-infeasible interior point algorithm for linearly constrained convex programming

Yanjin Wang; Pusheng Fei

Control and Cybernetics (2009)

  • Volume: 38, Issue: 3, page 687-704
  • ISSN: 0324-8569

How to cite

top

Wang, Yanjin, and Fei, Pusheng. "A primal-infeasible interior point algorithm for linearly constrained convex programming." Control and Cybernetics 38.3 (2009): 687-704. <http://eudml.org/doc/209638>.

@article{Wang2009,
author = {Wang, Yanjin, Fei, Pusheng},
journal = {Control and Cybernetics},
keywords = {linearly constrained convex programming; primal-infeasible interior point algorithm; polynomial complexity},
language = {eng},
number = {3},
pages = {687-704},
title = {A primal-infeasible interior point algorithm for linearly constrained convex programming},
url = {http://eudml.org/doc/209638},
volume = {38},
year = {2009},
}

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
VL - 38
IS - 3
SP - 687
EP - 704
LA - eng
KW - linearly constrained convex programming; primal-infeasible interior point algorithm; polynomial complexity
UR - http://eudml.org/doc/209638
ER -

NotesEmbed ?

top

You must be logged in to post comments.