An Interior-Point Method with Polynomial Complexity and Superlinear Convergence for Linear Complementarity Problems

Simple item page
dc.contributor.authorJi, Jun
dc.contributor.authorPotra, Florian
dc.contributor.authorTapia, Richard
dc.contributor.authorZhang, Yin
dc.date.accessioned2018-06-18T17:30:46Z
dc.date.available2018-06-18T17:30:46Z
dc.date.issued1991-07
dc.date.noteJuly 1991
dc.description.abstractFor linear programming, a primal-dual interior-point algorithm was recently constructed by Zhang and Tapia that achieves both polynomial complexity and Q-superlinear convergence (Q-quadratic in the nondegenerate case). In this paper, we extend their results to quadratic programming and linear complementarity problems.
dc.format.extent25 pp
dc.identifier.citationJi, Jun, Potra, Florian, Tapia, Richard, et al.. "An Interior-Point Method with Polynomial Complexity and Superlinear Convergence for Linear Complementarity Problems." (1991) <a href="https://hdl.handle.net/1911/101724">https://hdl.handle.net/1911/101724</a>.
dc.identifier.digitalTR91-23
dc.identifier.urihttps://hdl.handle.net/1911/101724
dc.language.isoeng
dc.titleAn Interior-Point Method with Polynomial Complexity and Superlinear Convergence for Linear Complementarity Problems
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR91-23.pdf
Size:
260.87 KB
Format:
Adobe Portable Document Format
Download
Collections
CAAM Technical Reports