Publication:5453751
From MaRDI portal
zbMath1161.90507MaRDI QIDQ5453751
Cornelis Roos, Goran Lešaja, Yan-Qin Bai
Publication date: 3 April 2008
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C51: Interior-point methods
Related Items
An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function, An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood, Large-update interior point algorithm for \(P_*\)-linear complementarity problem, A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function, An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term, A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem, An adaptive infeasible interior-point algorithm for linear complementarity problems, A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions, A full-Newton step interior-point algorithm for linear optimization based on a finite barrier, Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term, The accuracy of interior-point methods based on kernel functions, A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, 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, Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions, A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood
