A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
type: Item
instance of: scholarly article
title: A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
zbMATH Open document ID: 1390.90538
author: Ping Ji
author: Mingwang Zhang
author: Xin Li
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2018-04-05T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6856376
zbMATH Keywords: interior-point method
zbMATH Keywords: kernel function
zbMATH Keywords: complexity
zbMATH Keywords: linear complementarity problem
MaRDI profile type: Publication
full work available at URL: s10255-018-0729-y
OpenAlex ID: W2789873403
cites work: Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: Q5453751
cites work: A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
cites work: Q4003375
cites work: Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
cites work: A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
cites work: A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
cites work: Q3477904
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
cites work: Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
cites work: Self-regular functions and new search directions for linear and semidefinite optimization
cites work: A new class of polynomial primal-dual methods for linear and semidefinite optimization
cites work: Q4339096
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 full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
cites work: Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
cites work: Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
cites work: A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
cites work: Q5691079
DOI: 10.1007/S10255-018-0729-Y
description: scientific article; zbMATH DE number 6856376