A wide neighborhood homogeneous algorithm for monotone nonlinear complementarity problems

DOI10.13338/J.ISSN.1006-8341.2017.03.013zbMATH Open1399.90280MaRDI QIDQ4642995FDOQ4642995

Authors: Huali Zhao, Hengkun Zhu 

Publication date: 25 May 2018

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

zbMATH Keywords

interior point methodwide neighborhoodhomogenous algorithmmonotone nonlinear complementarity problem

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• A quadratically convergent algorithm in a wide neighborhood for linear complementarity problems
• Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
• Title not available (Why is that?)
• Complexities of homogeneous algorithm with one norm neighborhood for monotone nonlinear complementarity problems over symmetric cones

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)