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

DOI10.1186/S13660-019-1954-5zbMATH Open1499.90272OpenAlexW2908553427MaRDI QIDQ2067705FDOQ2067705

Authors: Yiyuan Zhou, Mingwang Zhang, Zhengwei Huang 

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

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

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)

Cites Work

• PCx: an interior-point code for linear programming
• Title not available (Why is that?)
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• 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
• Title not available (Why is that?)
• 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
• Solving large-scale linear programs by interior-point methods under the Matlab^∗Environment^†
• Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions
• On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
• On Mehrotra-Type Predictor-Corrector Algorithms
• Interior Point Methods for Linear Optimization
• Title not available (Why is that?)
• Complementarity problems
• Mehrotra-type predictor-corrector algorithm revisited
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
• On finding a vertex solution using interior point methods
• Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• Extending Mehrotra's corrector for linear programs
• Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem

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

Uses Software

• LIPSOL
• PCx

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)