Mathematical Sciences: Faculty Presentations (1991-2022)
A New Class of Polynomial Interior-Point Algorithms for P*(κ)-Linear Complementarity Problems
Document Type
Presentation
Presentation Date
8-13-2007
Copyright
This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.
Abstract or Description
We present a new class of short- and long-step polynomial interior-point algorithms for P*(κ)- Linear Complementarity Problems based on a new class of parametric kernel functions. This class is fairly general and includes the classical logarithmic function, the prototype self-regular function, and non-self-regular kernel functions as special cases. The iteration bounds obtained in this paper are very favorable and they match the best known existing iteration bounds
Sponsorship/Conference/Institution
International Conference on Continuous Optimization (ICCOPT)
Location
Ontario, Canada
Recommended Citation
Lesaja, Goran.
2007.
"A New Class of Polynomial Interior-Point Algorithms for P*(κ)-Linear Complementarity Problems."
Mathematical Sciences: Faculty Presentations (1991-2022).
Presentation 304.
https://digitalcommons.georgiasouthern.edu/math-sci-facpres/304
