Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
type: Item
instance of: scholarly article
title: Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
zbMATH Open document ID: 1183.65072
published in: Journal of Computational and Applied Mathematics
publication date: 2009-10-09T00:00:00Z
review text: The authors propose a class of polynomial interior-point algorithms for some horizontal linear complementarity problem based on a parametric kernel function. They analyze the interior-point algorithms using the uniformity of the kernel function. Also they develop some new analysis tools that are used in the complexity analysis of the algorithms and derive the currently best known iteration bounds for the algorithms with large and small update methods are presented.
reviewed by: Akrur Behera
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5612598
zbMATH Keywords: horizontal linear complementarity problem
zbMATH Keywords: kernel function
zbMATH Keywords: interior-point methods
zbMATH Keywords: iteration bounds
zbMATH Keywords: numerical examples
zbMATH Keywords: algorithms
author: Guoqiang Wang
author: Yanqin Bai
MaRDI profile type: Publication
full work available at URL: j.cam.2009.07.014
OpenAlex ID: W1979376655
cites work: Complementarity problems
cites work: Q4003375
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
cites work: An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
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: A polynomial-time algorithm for linear optimization based on a new class of kernel functions
cites work: Self-regular functions and new search directions for linear and semidefinite optimization
cites work: Interior-point methods
cites work: Q4339096
cites work: Equivaence between different formulations of the linear complementarity promblem
cites work: Fast convergence of the simplified largest step path following algorithm
cites work: The largest step path following algorithm for monotone linear complementarity problems
cites work: Q4526886
cites work: Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
cites work: Global convergence enhancement of classical linesearch interior point methods for MCPs
cites work: A matrix-splitting method for symmetric affine second-order cone complementarity problems
cites work: The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function
cites work: A smoothing Gauss-Newton method for the generalized HLCP
cites work: Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
cites work: Q5453751
cites work: A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
DOI: 10.1016/J.CAM.2009.07.014
description: scientific article; zbMATH DE number 5612598