What is it about?
This is the first paper in a series of papers on the study of local convergence behavior of iterates generated by an interior point algorithm on semi-definite programs through the study of underlying paths associated with these iterates.
Featured Image
Why is it important?
This paper provides a way to understand the convergence behavior of iterates when they are close to optimal solutions of a given semi-definite program by studying paths associated to these iterates.
Perspectives
This is the first work on this study undertaken by the first author.
Dr Chee Khian Sim
University of Portsmouth
Read the Original
This page is a summary of: Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem, Mathematical Programming, July 2006, Springer Science + Business Media,
DOI: 10.1007/s10107-006-0010-7.
You can read the full text:
Contributors
The following have contributed to this page
