On complexity of a new Mehrotra-type interior point algorithm for P_( ) linear complementarity problems

DOI10.1186/S13660-019-1954-5MaRDI QIDQ2067705zbMATH OpenOpenAlexFDO

Authors Yiyuan Zhou, Mingwang Zhang, Zhengwei Huang

Publication date 19 January 2022

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/s13660-019-1954-5

zbMATH Keywords

linear complementarity problempolynomial complexityinterior point algorithmMehrotra-type algorithm

Mathematics Subject Classification ID

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

Recommendations

• A Mehrotra type predictor-corrector interior-point method for \(P_\ast(\kappa)\)-HLCP
• scientific article; zbMATH DE number 6129935
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• Complexity of Mehrotra's predictor-corrector algorithms for monotone linear complementarity problems
• A predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems

Cites work

• scientific article; zbMATH DE number 4147426 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Complementarity problems
• Extending Mehrotra's corrector for linear programs
• Interior Point Methods for Linear Optimization
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• Mehrotra-type predictor-corrector algorithm revisited
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
• On Mehrotra-Type Predictor-Corrector Algorithms
• On finding a vertex solution using interior point methods
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
• PCx: an interior-point code for linear programming
• Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^†
• Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems

Cited in

(4)

• A Mehrotra type predictor-corrector interior-point method for \(P_\ast(\kappa)\)-HLCP
• A new second-order corrector interior-point algorithm for \(P_\ast (\kappa)\)-LCP
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones

Describes a project that uses

Uses Software

• PCx
• LIPSOL

This page was built for publication: On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems

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