Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones

DOI10.1080/02331934.2018.1477942zbMath1414.90341OpenAlexW2809013870MaRDI QIDQ4559409

Huali Zhao, Hong-Wei Liu

Publication date: 3 December 2018

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2018.1477942

zbMATH Keywords

complexitynonlinear complementarity problemsymmetric coneinterior point algorithmhomogeneous algorithm

Mathematics Subject Classification ID

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

Related Items (1)

A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones

Uses Software

• SCCP

Cites Work

• Unnamed Item
• Unnamed Item
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones
• An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• On a homogeneous algorithm for the monotone complementarity problem
• On a commutative class of search directions for linear programming over symmetric cones
• A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
• On theP_*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones
• An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
• A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
• Infeasible path-following interior point algorithm for Cartesian P_*(κ) nonlinear complementarity problems over symmetric cones
• Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
• Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

This page was built for publication: Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones