On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
From MaRDI portal
Publication:2067705
DOI10.1186/s13660-019-1954-5zbMath1499.90272OpenAlexW2908553427MaRDI QIDQ2067705
Zhengwei Huang, Ming Wang Zhang, Yiyuan Zhou
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-1954-5
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (1)
Uses Software
Cites Work
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- On finding a vertex solution using interior point methods
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions
- Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- Mehrotra-type predictor-corrector algorithm revisited
- On Mehrotra-Type Predictor-Corrector Algorithms
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- PCx: an interior-point code for linear programming
- Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones
- Interior Point Methods for Linear Optimization
- Complementarity problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems