Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity

DOI10.1007/BF02878714zbMath1002.90071OpenAlexW1607500176MaRDI QIDQ1609646

Shanglu He, Cheng-Xian Xu

Publication date: 15 August 2002

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02878714

zbMATH Keywords

complementarity problempolynomial-time complexityinfeasible-interior-point algorithmuniform \(P\)-function

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (1)

Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications

Cites Work

• A new continuation method for complementarity problems with uniform P- functions
• Global convergence in infeasible-interior-point algorithms
• On a homogeneous algorithm for the monotone complementarity problem
• On P- and S-functions and related classes of \(n\)-dimensional nonlinear mappings
• A General Framework of Continuation Methods for Complementarity Problems
• A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems

This page was built for publication: Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity