A combined homotopy interior point method for the linear complementarity problem
type: Item
instance of: scholarly article
title: A combined homotopy interior point method for the linear complementarity problem
zbMATH Open document ID: 1110.65054
author: Qian Yu
author: Chongchao Huang
author: Xianjia Wang
published in: Applied Mathematics and Computation
publication date: 2006-10-31T00:00:00Z
review text: The authors propose a homotopy interior point algorithm for the linear programming complementarity problem. Starting from any interior point, it follows a smooth homotopy path to reaching the solution by using a predictor-corrector technique. Convergence properties are discussed and a numerical example is given.
reviewed by: Ping-Qi Pan
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5069145
zbMATH Keywords: homotopy path
zbMATH Keywords: predictor-corrector algorithm
zbMATH Keywords: interior point algorithm
zbMATH Keywords: convergence
zbMATH Keywords: numerical example
MaRDI profile type: Publication
full work available at URL: j.amc.2005.12.010
OpenAlex ID: W2029939209
cites work: A new polynomial-time algorithm for linear programming
cites work: On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
cites work: An infeasible-interior-point algorithm for linear complementarity problems
cites work: A combined homotopy interior point method for general nonlinear programming problems
cites work: A combined homotopy interior point method for convex nonlinear programming
cites work: The aggregate constraint homotopy method for nonconvex nonlinear programming
cites work: Q5866869
DOI: 10.1016/J.AMC.2005.12.010
description: scientific article; zbMATH DE number 5069145