A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
From MaRDI portal
Publication:877592
DOI10.1016/j.ejor.2005.08.031zbMath1123.90347OpenAlexW2071001262MaRDI QIDQ877592
Publication date: 3 May 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.08.031
linear complementarity probleminterior point methodsufficient matrix\(\mathcal P_{\ast}(\kappa)\)-matrixMizuno-Todd-Ye predictor-corrector algorithm
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP ⋮ A corrector–predictor path-following algorithm for semidefinite optimization ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy ⋮ A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem ⋮ A corrector–predictor path-following method for second-order cone optimization ⋮ Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ A corrector-predictor interior-point method with new search direction for linear optimization ⋮ A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function ⋮ A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems ⋮ A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem ⋮ An RLT approach for solving the binary-constrained mixed linear complementarity problem ⋮ Interior point algorithm for \(P_*\) nonlinear complementarity problems ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step ⋮ On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficient matrices and the linear complementarity problem
- A polynomial-time algorithm for a class of linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
- On a subclass of \(P_ 0\)
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- \(P_ *\)-matrices are just sufficient
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
