On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
DOI10.1137/0803019zbMath0781.90074OpenAlexW1982356825MaRDI QIDQ5287110
Florian A. Potra, Richard A. Tapia, Yin Zhang
Publication date: 11 August 1993
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e09c99ff61dce3e5d2aa02ee043edc375c8525e8
quadratic programminglinear complementaritydamped Newton method\(Q\)-superlinear convergence theoryinterior-point linear programming algorithms
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items