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

DOI10.1007/BF02878714zbMATH Open1002.90071OpenAlexW1607500176MaRDI QIDQ1609646FDOQ1609646

Authors: 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

Recommendations

• A wide-neighborhood infeasible-interior-point algorithms for uniform P-function nonlinear complementary problems and its computational complexity
• A wide-neighborhood path-following algorithms for a class of nonmonotonic linear complementary problems and its computational complexity
• Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems
• scientific article; zbMATH DE number 2195332
• An infeasible interior-point algorithm for linear complementarity problem based on a kernel function

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications
• A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
• A wide-neighborhood infeasible-interior-point algorithms for uniform P-function nonlinear complementary problems and its computational complexity
• A wide-neighborhood path-following algorithms for a class of nonmonotonic linear complementary problems and its computational complexity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1609646)