A superquadratic infeasible-interior-point method for linear complementarity problems

DOI10.1007/BF02592215zbMath0852.90124MaRDI QIDQ1918925

Stephen J. Wright, Yin Zhang

Publication date: 13 October 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

linear complementarityasymptotic convergence ratepath-following infeasible-interior-point algorithmsuperquadratic rates

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (14)

Fast convergence of the simplified largest step path following algorithm ⋮ Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points ⋮ Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path ⋮ A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem ⋮ Optimized choice of parameters in interior-point methods for linear programming ⋮ Newton-type methods for solving quasi-complementarity problems via sign-based equation ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones ⋮ The sign-based methods for solving a class of nonlinear complementarity problems ⋮ The complexity of self-regular proximity based infeasible IPMs ⋮ Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions ⋮ A non-modulus linear method for solving the linear complementarity problem ⋮ Newton-type methods for solving vertical linear complementarity problems ⋮ Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise

Cites Work

• Unnamed Item
• Error bounds for nondegenerate monotone linear complementarity problems
• On Q-order and R-order of convergence
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• An infeasible-interior-point algorithm for linear complementarity problems
• Asymptotic convergence in a generalized predictor-corrector method
• Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• A path-following interior-point algorithm for linear and quadratic problems
• On the Implementation of a Primal-Dual Interior Point Method
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem
• Power Series Variants of Karmarkar-Type Algorithms
• A Superlinear Infeasible-Interior-Point Affine Scaling Algorithm for LCP

This page was built for publication: A superquadratic infeasible-interior-point method for linear complementarity problems