An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function
type: Item
instance of: scholarly article
title: An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function
zbMATH Open document ID: 1374.90416
author: Peng Zhang
published in: Journal of Applied Mathematics and Computing
publication date: 2017-11-10T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 6805289
zbMATH Keywords: monotone linear complementarity problem
zbMATH Keywords: infeasible interior-point methods
zbMATH Keywords: kernel function
zbMATH Keywords: complexity analysis
MaRDI profile type: Publication
full work available at URL: s12190-016-1019-6
OpenAlex ID: W2469290391
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem
cites work: Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
cites work: Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term
cites work: An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
cites work: Computational complexity of LCPs associated with positive definite symmetric matrices
cites work: A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function
cites work: A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
cites work: A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
cites work: Q3491304
cites work: A polynomial-time algorithm for a class of linear complementarity problems
cites work: Interior-point algorithm based on general kernel function for monotone linear complementarity problem
cites work: Feasibility issues in a primal-dual interior-point method for linear programming
cites work: A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
cites work: A path following method for LCP with superlinearly convergent iteration sequence
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: Q4039868
cites work: Self-regular functions and new search directions for linear and semidefinite optimization
cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
cites work: A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
DOI: 10.1007/S12190-016-1019-6
description: scientific article; zbMATH DE number 6805289