A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
From MaRDI portal
Publication:3124039
DOI10.1137/S1052623493262348zbMath0872.90096OpenAlexW2018770436MaRDI QIDQ3124039
Cornelis Roos, Tamás Terlaky, Benjamin Jansen
Publication date: 11 March 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623493262348
interior-point methodpolynomial affine scaling algorithmpositive semidefinite linear complementarity
Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A feasible primal-dual interior point method for linear semidefinite programming ⋮ Improved complexity using higher-order correctors for primal-dual Dikin affine scaling ⋮ Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems ⋮ Primal-dual target-following algorithms for linear programming ⋮ A polynomial path-following interior point algorithm for general linear complementarity problems ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
