Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function

DOI10.1016/j.amc.2008.11.002zbMath1160.90009OpenAlexW1979795234MaRDI QIDQ1002309

M. Reza Peyghami, Keyvan Amini

Publication date: 25 February 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2008.11.002

zbMATH Keywords

algorithmnumerical exampleslinear complementarity problemkernel functionpolynomial complexityproximity functionprimal-dual interior-point methodlarge updates method

Mathematics Subject Classification ID

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

Related Items (9)

Sufficient weighted complementarity problems ⋮ A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem ⋮ Kernel function based interior-point methods for horizontal linear complementarity problems ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ 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 ⋮ A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION ⋮ An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term ⋮ Large-update interior point algorithm for \(P_*\)-linear complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A self-adjusting interior point algorithm for linear complementarity problems
• An interior-point algorithm for linear optimization based on a new kernel function
• A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
• Test examples for nonlinear programming codes
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Log-barrier method for two-stage quadratic stochastic programming
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• Self-regular functions and new search directions for linear and semidefinite optimization
• Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
• Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
• Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A polynomial-time algorithm for linear optimization based on a new simple kernel function
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

This page was built for publication: Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function