article · Institutional Repositories DataBase (IRDB) · 1998

Monotonicity of Primal-Dual Interior-Point Algorithms for Semidefinite Programming Problems

Cited by 0Abstract and details only

Abstract

The index has no abstract for this paper.

Cite this paper

小島, 政., & Kojima, M. (1998). Monotonicity of Primal-Dual Interior-Point Algorithms for Semidefinite Programming Problems. Institutional Repositories DataBase (IRDB), 10(2), 275–296.

MLA 9

小島, 政和, and Masakazu Kojima. “Monotonicity of Primal-Dual Interior-Point Algorithms for Semidefinite Programming Problems.” Institutional Repositories DataBase (IRDB), vol. 10, no. 2, 1998, pp. 275–96.

Chicago

小島, 政和, and Masakazu Kojima. 1998. “Monotonicity of Primal-Dual Interior-Point Algorithms for Semidefinite Programming Problems.” Institutional Repositories DataBase (IRDB) 10 (2): 275–96.

Harvard

小島, 政. and Kojima, M. (1998) ‘Monotonicity of Primal-Dual Interior-Point Algorithms for Semidefinite Programming Problems’, Institutional Repositories DataBase (IRDB), 10(2), pp. 275–296.

BibTeX

@article{anon1998monotonicity,
  title = {{Monotonicity of Primal-Dual Interior-Point Algorithms for Semidefinite Programming Problems}},
  author = {小島, 政和 and Kojima, Masakazu},
  journal = {Institutional Repositories DataBase (IRDB)},
  volume = {10},
  number = {2},
  pages = {275--296},
  year = {1998}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.