An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
From MaRDI portal
Publication:2346488
DOI10.1007/s12190-014-0794-1zbMath1323.90070MaRDI QIDQ2346488
Publication date: 2 June 2015
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-014-0794-1
kernel function; primal-dual interior point methods; large-update methods; \(P_*(\kappa)\)-linear complementarity problem
90C05: Linear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C51: Interior-point methods
Related Items
A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function, 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, An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term, An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function, An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function, An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization, A generic kernel function for interior point methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A new polynomial-time algorithm for linear programming
- 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
- \(P_ *\)-matrices are just sufficient
- 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
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- Engineering and Economic Applications of Complementarity Problems
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- 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
