On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
type: Item
instance of: scholarly article
title: On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
zbMATH Open document ID: 0961.90118
DOI: 10.1023/A:1026492106091
author: Gongyun Zhao
author: Jie Sun
published in: Computational Optimization and Applications
publication date: 2000-01-05T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 1385192
zbMATH Keywords: linear complementarity problem
zbMATH Keywords: interior point method
zbMATH Keywords: high-order algorithm
zbMATH Keywords: local convergence
zbMATH Keywords: \(P_*\)-linear complementarity problem
MaRDI profile type: Publication
full work available at URL: a:1026492106091
OpenAlex ID: W1508337438
Recommended article: On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
Recommended article: The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions
Recommended article: The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
Recommended article: On Superlinear and Convergence of a Path-Following Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood
Recommended article: A new path-following algorithm for nonlinear \(P_*\) complementarity problems
Recommended article: Complexity of a noninterior path-following method for the linear complementarity problem
Recommended article: Q3171197
Recommended article: Q3428948
Recommended article: Q3501237
Recommended article: High order infeasible-interior-point methods for solving sufficient linear complementarity problems
description: scientific article; zbMATH DE number 1385192