A wide neighborhood homogeneous algorithm for monotone nonlinear complementarity problems

DOI10.13338/J.ISSN.1006-8341.2017.03.013MaRDI QIDQ4642995zbMATH OpenFDO

Authors Huali Zhao, Hengkun Zhu

Publication date 25 May 2018

Full work available at URL https://doi.org/10.13338/J.ISSN.1006-8341.2017.03.013

zbMATH Keywords

homogenous algorithminterior point methodmonotone nonlinear complementarity problemwide neighborhood

Mathematics Subject Classification ID

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

Recommendations

• Complexities of homogeneous algorithm with one norm neighborhood for monotone nonlinear complementarity problems over symmetric cones
• Complexity analysis of a wide neighborhood interior point method for nonmonotone LCP
• A quadratically convergent algorithm in a wide neighborhood for linear complementarity problems
• scientific article; zbMATH DE number 2016712
• Modifications of a wide-neighborhood path-following algorithm for a class of nonmonotonic linear complementary problems

Cited in

(5)

• A quadratically convergent algorithm in a wide neighborhood for linear complementarity problems
• scientific article; zbMATH DE number 5564090 (Why is no real title available?)
• Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
• Complexities of homogeneous algorithm with one norm neighborhood for monotone nonlinear complementarity problems over symmetric cones
• scientific article; zbMATH DE number 6402146 (Why is no real title available?)

This page was built for publication: A wide neighborhood homogeneous algorithm for monotone nonlinear complementarity problems

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