A path-following interior-point algorithm for linear and quadratic problems
type: Item
instance of: scholarly article
title: A path-following interior-point algorithm for linear and quadratic problems
zbMATH Open document ID: 0848.90114
DOI: 10.1007/BF02206813
author: Stephen J. Wright
published in: Annals of Operations Research
publication date: 1996-10-09T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 894980
zbMATH Keywords: path-following interior-point methods
zbMATH Keywords: \(Q\)-subquadratic convergence
zbMATH Keywords: monotone linear complementarity
zbMATH Keywords: convex quadratic programming
MaRDI profile type: Publication
cites work: Generalized Linear Complementarity Problems
cites work: Error bounds for nondegenerate monotone linear complementarity problems
cites work: Monotone (nonlinear) operators in Hilbert space
cites work: Superlinear primal-dual affine scaling algorithms for LCP
cites work: Local convergence of interior-point algorithms for degenerate monotone LCP
cites work: An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
cites work: An infeasible-interior-point algorithm for linear complementarity problems
cites work: On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
full work available at URL: https://doi.org/10.1007/bf02206813
OpenAlex ID: W2571013927
description: scientific article; zbMATH DE number 894980