Kernel function based interior-point methods for horizontal linear complementarity problems
From MaRDI portal
Publication:394593
DOI10.1186/1029-242X-2013-215zbMATH Open1285.90075WikidataQ59292643 ScholiaQ59292643MaRDI QIDQ394593FDOQ394593
Authors: Yong-Hoon Lee, You-Young Cho, Gyeong-Mi Cho 
Publication date: 27 January 2014
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Recommendations
- Based on a class of kernel functions interior-point algorithms for \(P_*(\kappa)\)-horizontal linear complementarity problems
- Interior-point methods for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- 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 smoothing Gauss-Newton method for the generalized HLCP
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
Cited In (8)
- Based on a class of kernel functions interior-point algorithms for \(P_*(\kappa)\)-horizontal linear complementarity problems
- An efficient multi parametric kernel function for large and small-update methods interior point algorithm for P*(κ)-horizontal linear complementarity problem
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- Interior-point methods for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
- A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
- An interior point approach for linear complementarity problem using new parametrized kernel function
This page was built for publication: Kernel function based interior-point methods for horizontal linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394593)
