Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones
DOI10.1080/00207160.2018.1429597zbMath1499.90258OpenAlexW2791480837MaRDI QIDQ5031768
Publication date: 16 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.2018.1429597
nonlinear complementarity problemsymmetric conepredictor-correctorinterior point algorithmCartesian \(P_\ast(\kappa )\)
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
- Test examples for nonlinear programming codes
- 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
- Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
- Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones
- 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: Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones
