Complexities of homogeneous algorithm with one norm neighborhood for monotone nonlinear complementarity problems over symmetric cones

zbMATH Open1488.90219MaRDI QIDQ5017487FDOQ5017487

Authors: Huali Zhao 

Publication date: 17 December 2021

Recommendations

• A wide neighborhood homogeneous algorithm for monotone nonlinear complementarity problems
• Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
• scientific article; zbMATH DE number 5564090
• scientific article; zbMATH DE number 1059215
• A wide-neighborhood infeasible-interior-point algorithms for uniform P-function nonlinear complementary problems and its computational complexity

zbMATH Keywords

interior point methodwide neighborhoodhomogeneous algorithmmonotone nonlinear complementarity problem

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones
• A wide neighborhood homogeneous algorithm for monotone nonlinear complementarity problems

This page was built for publication: Complexities of homogeneous algorithm with one norm neighborhood for monotone nonlinear complementarity problems over symmetric cones

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