A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem

DOI10.1007/s10114-010-7529-5zbMath1206.90195OpenAlexW2030548196MaRDI QIDQ606335

Keyvan Amini, M. Reza Peyghami

Publication date: 17 November 2010

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-010-7529-5

zbMATH Keywords

polynomial complexitylarge and small update methods

Mathematics Subject Classification ID

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

Related Items (11)

An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term ⋮ An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term ⋮ Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function ⋮ Complementarity properties of the Lyapunov transformation over symmetric cones ⋮ An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function ⋮ Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function ⋮ An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function ⋮ An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term ⋮ An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A self-adjusting interior point algorithm for linear complementarity problems
• An interior-point algorithm for linear optimization based on a new kernel function
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• Self-regular functions and new search directions for linear and semidefinite optimization
• \(P_ *\)-matrices are just sufficient
• A superquadratic infeasible-interior-point method for linear complementarity problems
• A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
• Engineering and Economic Applications of Complementarity Problems
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A polynomial-time algorithm for linear optimization based on a new simple kernel function
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• An interior point method for linear programming based on a class of Kernel functions

This page was built for publication: A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem