A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem
type: Item
instance of: scholarly article
title: A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem
zbMATH Open document ID: 1326.90091
author: Danhua Zhu
author: Mingwang Zhang
published in: Journal of Systems Science and Complexity
publication date: 2015-11-10T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6506957
zbMATH Keywords: full-Newton steps
zbMATH Keywords: infeasible interior-point method
zbMATH Keywords: \(P_\ast (\kappa)\) linear complementarity problems
zbMATH Keywords: polynomial complexity
MaRDI profile type: Publication
full work available at URL: s11424-014-1273-3
OpenAlex ID: W2053561689
cites work: Q4003375
cites work: Interior Point Methods for Linear Optimization
cites work: Q5691079
cites work: A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
cites work: A unified approach to interior point algorithms for linear complementary problems
cites work: A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
cites work: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
cites work: An asymptotical \(O((k+1)n^3L)\) affine scaling algorithm for the \(P_*(k)\)-matrix linear complementarity problem
cites work: Q3160958
cites work: Self-regular functions and new search directions for linear and semidefinite optimization
cites work: Q4791754
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
cites work: SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
cites work: A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
cites work: A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
DOI: 10.1007/S11424-014-1273-3
description: scientific article; zbMATH DE number 6506957