A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function

DOI10.1007/s40305-015-0113-zzbMath1338.90404OpenAlexW2285421266MaRDI QIDQ290328

Maryam Zangiabadi, Hossein Mansouri, Soodabeh Asadi

Publication date: 1 June 2016

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-015-0113-z

zbMATH Keywords

kernel functionhorizontal linear complementarity problemcentral pathinfeasible interior-point method

Mathematics Subject Classification ID

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

Related Items (2)

Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones

Cites Work

• A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
• Corrector-predictor methods for sufficient linear complementarity problems
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• A new polynomial-time algorithm for linear programming
• A unified approach to interior point algorithms for linear complementary problems
• Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• A smoothing Gauss-Newton method for the generalized HLCP
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function