An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
DOI10.1007/s12190-019-01284-9zbMath1475.90109OpenAlexW2972976082MaRDI QIDQ2053282
Publication date: 29 November 2021
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-019-01284-9
primal-dual interior point methodslarge-update methodstrigonometric kernel functionhorizontal linear complementarity problems
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- Kernel function based interior-point methods for horizontal linear complementarity problems
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- 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 New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP
This page was built for publication: An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function