Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems

From MaRDI portal





The authors prove the polynomial iterative complexity of a predictor-corrector type interior-point algorithm for a class of non-monotone nonlinear complementarity problems based on the assumption that the scaled Lipschitz condition is satisfied.



Cites work









This page was built for publication: Iteration complexity of an interior-point algorithm for nonlinear p∗-complementarity problems

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