An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function

DOI10.1007/s12190-016-1019-6zbMath1374.90416OpenAlexW2469290391MaRDI QIDQ1677001

Peng Zhang

Publication date: 10 November 2017

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-016-1019-6

zbMATH Keywords

kernel functioncomplexity analysisinfeasible interior-point methodsmonotone linear complementarity problem

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• Feasibility issues in a primal-dual interior-point method for linear programming
• A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem
• A polynomial-time algorithm for a class of linear complementarity problems
• A path following method for LCP with superlinearly convergent iteration sequence
• Self-regular functions and new search directions for linear and semidefinite optimization
• An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
• Interior-point algorithm based on general kernel function for monotone linear complementarity problem
• Computational complexity of LCPs associated with positive definite symmetric matrices
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

This page was built for publication: An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function