Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path

DOI10.1137/S1052623494275574zbMath0913.90254OpenAlexW1986106357MaRDI QIDQ4389198

Gongyun Zhao

Publication date: 12 May 1998

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623494275574

zbMATH Keywords

complexitylinear complementarity probleminterior point algorithmlarge neighborhoodlarge stephigh-order power series

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (9)

Hessian distances and their applications in the complexity analysis of interior-point methods ⋮ A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS ⋮ Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path ⋮ Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem ⋮ Unnamed Item ⋮ A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems^* ⋮ Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path ⋮ Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions ⋮ A new class of polynomial primal-dual methods for linear and semidefinite optimization

This page was built for publication: Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path