A New Long-Step Path-Following Interior-Point Method with O(vnL) Iteration-Complexity Bound for Semidefinite Programming

Zengzhe Feng, Liang Fang. A New Long-Step Path-Following Interior-Point Method with O(vnL) Iteration-Complexity Bound for Semidefinite Programming. In Haiying Wang, Kay-Soon Low, Kexin Wei, Junqing Sun, editors, Fifth International Conference on Natural Computation, ICNC 2009, Tianjian, China, 14-16 August 2009, 6 Volumes. pages 293-298, IEEE Computer Society, 2009. [doi]

@inproceedings{FengF09,
  title = {A New Long-Step Path-Following Interior-Point Method with O(vnL) Iteration-Complexity Bound for Semidefinite Programming},
  author = {Zengzhe Feng and Liang Fang},
  year = {2009},
  doi = {10.1109/ICNC.2009.717},
  url = {http://doi.ieeecomputersociety.org/10.1109/ICNC.2009.717},
  tags = {programming},
  researchr = {https://researchr.org/publication/FengF09},
  cites = {0},
  citedby = {0},
  pages = {293-298},
  booktitle = {Fifth International Conference on Natural Computation, ICNC 2009, Tianjian, China, 14-16 August 2009, 6 Volumes},
  editor = {Haiying Wang and Kay-Soon Low and Kexin Wei and Junqing Sun},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-3736-8},
}