Interior-Point Method for Conic Linear Complementarity Problem
Document Type
Presentation
Presentation Date
8-23-2009
Abstract or Description
We present primal-dual interior-point method for monotone linear commplementarity problem on symmetric cones that is based on Nesterov-Todd direction. It is shown that if the problem has strictly feasible interior point, then the method is globally convergent with polynomial iteration bound that matches the currently best known iteration bound obtained for these problems and these methods.
Sponsorship/Conference/Institution
International Symposium on Mathematical Programming (ISMP)
Location
Chicago, IL
Recommended Citation
Lesaja, Goran.
2009.
"Interior-Point Method for Conic Linear Complementarity Problem."
Department of Mathematical Sciences Faculty Presentations.
Presentation 321.
https://digitalcommons.georgiasouthern.edu/math-sci-facpres/321
