On homogeneous and self-dual algorithms for LCP
type: Item
instance of: scholarly article
title: On homogeneous and self-dual algorithms for LCP
zbMATH Open document ID: 0881.90116
DOI: 10.1007/BF02614384
author: Yinyu Ye
published in: Mathematical Programming. Series A. Series B
publication date: 1998-02-19T00:00:00Z
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 1038509
zbMATH Keywords: homogeneous and self-dual linear programming
zbMATH Keywords: monotone linear complementarity
zbMATH Keywords: infeasible-starting algorithm
MaRDI profile type: Publication
cites work: Q4003375
cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
cites work: Convergence behavior of interior-point algorithms
cites work: Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
cites work: Error bounds for monotone linear complementarity problems
cites work: A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
cites work: Local convergence of interior-point algorithms for degenerate monotone LCP
cites work: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
cites work: Some perturbation theory for linear programming
cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
cites work: A simplified homogeneous and self-dual linear programming algorithm and its implementation
full work available at URL: https://doi.org/10.1007/bf02614384
OpenAlex ID: W2065615220
description: scientific article; zbMATH DE number 1038509