A quadratically convergent algorithm in a wide neighborhood for linear complementarity problems

MaRDI QIDQ3132399zbMATH OpenFDO

Authors Xiaojue Ma, Hongwei Liu

Publication date 29 January 2018

zbMATH Keywords

linear complementarity problemquadratic convergencewide neighborhoodprimal-dual interior-point method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems
• A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood
• On extending some wide-neighborhood interior point algorithms from linear programming to linear complementarity problems
• A wide neighborhood homogeneous algorithm for monotone nonlinear complementarity problems
• scientific article; zbMATH DE number 2016712

Cited in

(4)

• scientific article; zbMATH DE number 2013209 (Why is no real title available?)
• scientific article; zbMATH DE number 3852813 (Why is no real title available?)
• A wide neighborhood homogeneous algorithm for monotone nonlinear complementarity problems
• On superlinear and \(O(\sqrt{n}L)\) convergence of a path-following algorithm for monotone linear complementarity problems in a wide neighborhood

This page was built for publication: A quadratically convergent algorithm in a wide neighborhood for linear complementarity problems

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