Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones

DOI10.1080/00207160.2017.1297803zbMath1499.90257OpenAlexW2591560948MaRDI QIDQ5026485

Huali Zhao, Hong-Wei Liu

Publication date: 8 February 2022

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

nonlinear complementarity problemsymmetric coneinterior point algorithminfeasibleCartesian \(P_\ast(\kappa )\)

Mathematics Subject Classification ID

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

Related Items (4)

Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P_*(κ) nonlinear complementarity problems over symmetric cones ⋮ Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones ⋮ A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
• 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
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
• Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
• Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
• VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
• Computational complexity of LCPs associated with positive definite symmetric matrices
• Iterative methods for linear complementarity problems with upperbounds on primary variables
• Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP_*(κ)-LCP 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
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

This page was built for publication: Infeasible path-following interior point algorithm for Cartesian P_*(κ) nonlinear complementarity problems over symmetric cones