Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
From MaRDI portal
Publication:1760104
DOI10.1016/J.APNUM.2012.05.009zbMATH Open1262.65067OpenAlexW1964764811MaRDI QIDQ1760104FDOQ1760104
Authors: Xinze Liu, Hongwei Liu, Changhe Liu 
Publication date: 12 November 2012
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2012.05.009
Recommendations
- Corrector-predictor methods for sufficient linear complementarity problems
- scientific article; zbMATH DE number 6129935
- Complexity of Mehrotra's predictor-corrector algorithms for monotone linear complementarity problems
- An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
linear complementarity problempolynomial complexitypredictor-corrector algorithminterior-point methodmehrotra-type algorithm
Cites Work
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- \(P_ *\)-matrices are just sufficient
- Title not available (Why is that?)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Corrector-predictor methods for sufficient linear complementarity problems
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- Further development of multiple centrality correctors for interior point methods
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- On Mehrotra-Type Predictor-Corrector Algorithms
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
- An infeasible-start path-following method for monotone LCPs
- Predictor-corrector method for nonlinear complementarity problems
- Asymptotic convergence in a generalized predictor-corrector method
Cited In (13)
- Title not available (Why is that?)
- A Mehrotra type predictor-corrector interior-point method for \(P_\ast(\kappa)\)-HLCP
- On the convergence analysis of arc search interior point methods for LCPs
- A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones
- Infeasible path-following interior point algorithm for Cartesian \(P_\ast(\kappa )\) nonlinear complementarity problems over symmetric cones
- A Mehrotra predictor-corrector algorithm for linear complementarity problem
- A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood
- A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming
- Polynomial convergence of Mehrotra-type predictor-corrector algorithm for the Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
- A step-truncated method in a wide neighborhood interior-point algorithm for linear programming
- On Mehrotra-Type Predictor-Corrector Algorithms
This page was built for publication: Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760104)
