Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems

DOI10.1016/j.camwa.2006.12.004zbMath1135.90410OpenAlexW1985152446MaRDI QIDQ2458697

Yanyan Li

Publication date: 2 November 2007

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.12.004

zbMATH Keywords

complexitylinear complementarity problempolynomial algorithmprimal-dual interior point methodKernel functionlarge-update

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (10)

Sufficient weighted complementarity problems ⋮ A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems ⋮ A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem ⋮ A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions ⋮ Using vector divisions in solving the linear complementarity problem ⋮ 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 algorithm for \(P_*\) nonlinear 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A self-adjusting interior point algorithm for linear complementarity problems
• An interior-point algorithm for linear optimization based on a new kernel function
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Log-barrier method for two-stage quadratic stochastic programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

This page was built for publication: Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems