A full-step interior-point algorithm for linear complementarity problem based on a simple function
type: Item
instance of: scholarly article
title: A full-step interior-point algorithm for linear complementarity problem based on a simple function
zbMATH Open document ID: 1244.90229
DOI: 10.1080/02522667.2011.10700121
author: Lipu Zhang
author: Yinghong Xu
publication date: 2012-08-08T00:00:00Z
full work available at URL: 1268706H 05 JIOS T108 32-6 pp1315-1332a.pdf
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6064086
zbMATH Keywords: linear complementarity problems
zbMATH Keywords: interior-point algorithm
zbMATH Keywords: complexity analysis
MaRDI profile type: Publication
OpenAlex ID: W2330601161
cites work: A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: Homotopy Continuation Methods for Nonlinear Complementarity Problems
cites work: A unified approach to interior point algorithms for linear complementary problems
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: New complexity analysis of the primal-dual Newton method for linear optimization
cites work: Self-regular functions and new search directions for linear and semidefinite optimization
cites work: Q4791754
cites work: Interior point methods of mathematical programming
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
published in: Journal of Information \& Optimization Sciences
description: scientific article; zbMATH DE number 6064086