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

DOI10.1016/J.AMC.2006.04.060MaRDI QIDQ858773zbMATH OpenOpenAlexFDO

Authors 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) Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A large-update interior point algorithm for \(P_*(\kappa)\) LCP based on a new kernel 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
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• An efficient multi parametric kernel function for large and small-update methods interior point algorithm for P_*(κ)-horizontal linear complementarity problem
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
• A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions
• A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function

Cites work

• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 4126998 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A polynomial-time algorithm for a class of linear complementarity problems
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• A unified approach to interior point algorithms for linear complementary problems
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• Self-regular functions and new search directions for linear and semidefinite optimization
• The Mizuno-Todd-Ye predictor-corrector algorithm for sufficient matrix linear complementarity problem

Cited in

(18)

• Kernel function based interior-point methods for horizontal linear complementarity problems
• Large-update interior point algorithm for P_*-linear complementarity problem
• A Mehrotra type predictor-corrector interior-point method for \(P_\ast(\kappa)\)-HLCP
• Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• 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 class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
• Primal-dual algorithms for \(P_\ast(\kappa)\) linear complementarity problems based on kernel-function with trigonometric barrier term
• A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
• Kernel-function based primal-dual algorithms for \(P_* (\kappa )\) linear complementarity problems
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• An interior-point algorithm based on general kernel function for monotone linear complementarity problem
• A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
• On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858773)