A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
From MaRDI portal
Publication:2062428
DOI10.3934/naco.2020053zbMath1476.90327OpenAlexW3097247969MaRDI QIDQ2062428
Publication date: 27 December 2021
Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/naco.2020053
interior-point methodkernel functionhorizontal linear complementarity problemcomplexity bound\(P_\ast( \kappa )\)-matrix
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Large-update interior point algorithm for \(P_*\)-linear complementarity problem
- 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
- 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 unified approach to interior point algorithms for linear complementarity problems: A summary
- A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
- Self-regular functions and new search directions for linear and semidefinite optimization
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- Complexity of interior-point methods for linear optimization based on a new 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
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- Complexity analysis of a weighted-full-Newton step interior-point algorithm forP∗(κ)-LCP
- Kernel-function Based Primal-Dual Algorithms forP*(κ) Linear Complementarity Problems
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function
- Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
