A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions

DOI10.1016/j.amc.2006.04.060zbMath1108.65061OpenAlexW2086586960MaRDI QIDQ858773

Gyeong-Mi Cho, Min-Kyung Kim

Publication date: 11 January 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.04.060

zbMATH Keywords

linear complementarity problemskernel function

Mathematics Subject Classification ID

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 (17)

A Mehrotra Type Predictor-Corrector Interior-Point Method for P∗(κ)-HLCP ⋮ A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem ⋮ Kernel function based interior-point methods for horizontal linear complementarity problems ⋮ Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term ⋮ On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function ⋮ A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions ⋮ Interior-point algorithms for \(P_{*}(\kappa )\)-LCP 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 ⋮ A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems ⋮ Interior-point algorithm based on general kernel function for monotone linear complementarity problem ⋮ Kernel-function Based Primal-Dual Algorithms forP_*(κ) Linear Complementarity Problems ⋮ An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function ⋮ Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function ⋮ A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions ⋮ On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems ⋮ Large-update interior point algorithm for \(P_*\)-linear complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm for a class of linear complementarity problems
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• A unified approach to interior point algorithms for linear complementary problems
• Self-regular functions and new search directions for linear and semidefinite optimization
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

This page was built for publication: A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions