A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems

DOI10.1007/s40305-015-0070-6zbMath1317.90324OpenAlexW2056108806MaRDI QIDQ2356344

Hossein Mansouri, Maryam Zangiabadi, Soodabeh Asadi

Publication date: 29 July 2015

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-0070-6

zbMATH Keywords

interior-point methodkernel functionpolynomial complexityhorizontal linear complementarity problemcentral path

Mathematics Subject Classification ID

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

Related Items (5)

A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function ⋮ A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions ⋮ Two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
• Corrector-predictor methods for sufficient linear complementarity problems
• A new primal-dual path-following method for convex quadratic programming
• Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
• A new polynomial-time algorithm for linear programming
• Test examples for nonlinear programming codes
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
• Fast convergence of the simplified largest step path following algorithm
• Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
• The largest step path following algorithm for monotone linear complementarity problems
• An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
• A matrix-splitting method for symmetric affine second-order cone complementarity problems
• Self-regular functions and new search directions for linear and semidefinite optimization
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function
• The convergence of a one-step smoothing Newton method for \(P_0\)-NCP based on a new smoothing NCP-function
• Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• Generic Primal-dual Interior Point Methods Based on a New Kernel Function
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• 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
• An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
• A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
• A smoothing Gauss-Newton method for the generalized HLCP

This page was built for publication: A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems