An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
DOI10.1007/s12190-015-0978-3zbMath1391.90590OpenAlexW2266340794MaRDI QIDQ513522
Yan Chen, Ming Wang Zhang, Xin Li
Publication date: 7 March 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-015-0978-3
linear complementarity problemkernel functioninterior-point algorithmiteration complexitylarge-update
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large-update interior point algorithm for \(P_*\)-linear complementarity problem
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- 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
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
- A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
- Self-regular functions and new search directions for linear and semidefinite optimization
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- 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 new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- Engineering and Economic Applications of 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
This page was built for publication: An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term