A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
type: Item
instance of: scholarly article
title: A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
zbMATH Open document ID: 1475.90130
author: Mingwang Zhang
author: Kun Huang
author: Mengmeng Li
author: Yanli Lv
published in: Journal of Applied Mathematics and Computing
publication date: 2021-11-29T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 7435136
zbMATH Keywords: IPMs
zbMATH Keywords: \(P_*(\kappa)\)-LCPs
zbMATH Keywords: full-Newton step
zbMATH Keywords: positive-asymptotic kernel function
MaRDI profile type: Publication
full work available at URL: s12190-020-01356-1
OpenAlex ID: W3024413612
cites work: A new polynomial-time algorithm for linear programming
cites work: Q4339096
cites work: Q5691079
cites work: Q4003375
cites work: A polynomial method of approximate centers for linear programming
cites work: Q4324980
cites work: Self-regular functions and new search directions for linear and semidefinite optimization
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
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: EP theorem for dual linear complementarity problems
cites work: A polynomial path-following interior point algorithm for general linear complementarity problems
cites work: Q5453751
cites work: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
cites work: A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
cites work: A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
cites work: Q5309527
cites work: Q3415802
cites work: A new primal-dual path-following method for convex quadratic programming
cites work: Q4577944
cites work: New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
cites work: A new primal-dual path-following interior-point algorithm for semidefinite optimization
cites work: A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
cites work: A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
cites work: A full-Newton step interior-point algorithm based on modified Newton direction
cites work: New method for determining search directions for interior-point algorithms in linear optimization
cites work: Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
cites work: Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
cites work: Q3477904
cites work: A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
DOI: 10.1007/S12190-020-01356-1
description: scientific article; zbMATH DE number 7435136