A high-order primal-dual interior point algorithm for a class of nonmonotonic linear complementarity in a wide neighborhood of the central path

zbMATH Open1183.90419MaRDI QIDQ3405161FDOQ3405161

Authors: Xiaoyu Gong, Mingwang Zhang 

Publication date: 12 February 2010

Recommendations

• A high-order wide neighborhood interior-point algorithm for solving \(P_*(\tau)\) matrix linear complementarity problem
• scientific article; zbMATH DE number 2016712
• scientific article; zbMATH DE number 1376878
• A high-order affine scaling interior-point algorithm for solving \(P_* (\kappa)\)-matrix linear complementarity problems
• Complexity analysis of a wide neighborhood interior point method for nonmonotone LCP

zbMATH Keywords

complementarity problemwide neighborhoodinterior algorithm

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• A high-order Dikin-type algorithm for \(P_* (\kappa)\)-LCPs in a wide neighborhood of the central path
• Complexity analysis of a wide neighborhood interior point method for nonmonotone LCP
• Title not available (Why is that?)
• Modifications of a wide-neighborhood path-following algorithm for a class of nonmonotonic linear complementary problems
• A high-order affine scaling interior-point algorithm for solving \(P_* (\kappa)\)-matrix linear complementarity problems
• A high-order wide neighborhood interior-point algorithm for solving \(P_*(\tau)\) matrix linear complementarity problem

This page was built for publication: A high-order primal-dual interior point algorithm for a class of nonmonotonic linear complementarity in a wide neighborhood of the central path

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