Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
From MaRDI portal
Publication:3083319
DOI10.1137/090766735zbMath1211.90160MaRDI QIDQ3083319
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090766735
interior-point method; linear complementarity problem; polynomial complexity; kernel functions; \(P_*(\kappa)\)-matrix
Related Items
Unnamed Item, A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function, Large-update interior point algorithm for \(P_*\)-linear complementarity problem, Kernel function based interior-point methods for horizontal linear complementarity problems, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function, New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, A primal-dual large-update interior-point algorithm 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, Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood, 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, An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity 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, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, A corrector-predictor interior-point method with new search direction for linear optimization, A generic kernel function for interior point methods, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem, 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
