Monotonicity of primal-dual interior-point algorithms for semidefinite programming problems (1998)
by
Masakazu Kojima
,
Levent Tuncel
| Citations: | 163 - 32 self |
BibTeX
@MISC{Kojima98monotonicityof,
author = {Masakazu Kojima and Levent Tuncel},
title = {Monotonicity of primal-dual interior-point algorithms for semidefinite programming problems},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present primal-dual interior-point algorithms with polynomial iteration bounds to find approximate solutions of semidefinite programming problems. Our algorithms achieve the current best iteration bounds and, in every iteration of our algorithms, primal and dual objective values are strictly improved.
