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

MaRDI QIDQ5017487zbMATH OpenFDO

Authors Huali Zhao

Publication date 17 December 2021

zbMATH Keywords

homogeneous algorithminterior point methodmonotone nonlinear complementarity problemwide neighborhood

Mathematics Subject Classification ID

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

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

Cited in

(4)

• scientific article; zbMATH DE number 5564090 (Why is no real title available?)
• scientific article; zbMATH DE number 1059215 (Why is no real title available?)
• 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)