A new infeasible interior-point algorithm for linear complementarity problem

DOI10.1007/S11859-013-0923-YMaRDI QIDQ5400131zbMATH OpenOpenAlexFDO

Authors Xiaoyu Gong, Zhenpeng Hu, Xianjia Wang

Publication date 28 February 2014

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11859-013-0923-y

zbMATH Keywords

linear complementarity problempolynomial complexityinfeasible interior-point methodfull-Newton step

Mathematics Subject Classification ID

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

Recommendations

• A new infeasible interior-point method for linear complementarity problem based on full Newton step
• An infeasible interior-point algorithm for linear complementarity problem based on a kernel function
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function
• A new full-Newton infeasible interior-point algorithm for \(P_*(\kappa)\) linear complementarity problems

Cites work

• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• A new and efficient large-update interior-point method for linear optimization
• A new polynomial-time algorithm for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• Feasibility issues in a primal-dual interior-point method for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps

Cited in

(15)

• An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• A full-step interior-point algorithm for linear complementarity problem based on a simple function
• An infeasible interior-point algorithm for linear complementarity problem based on a kernel function
• On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method
• scientific article; zbMATH DE number 2104098 (Why is no real title available?)
• An infeasible interior point method for the monotone linear complementarity problem
• Infeasible full Newton-step interior-point method for linear complementarity problems
• An infeasible interior-point method with improved centering steps for monotone linear complementarity problems
• An adaptive infeasible interior-point algorithm for linear complementarity problems
• An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
• scientific article; zbMATH DE number 6020688 (Why is no real title available?)
• An infeasible interior point algorithm for \(P_0\)-LCP based on algebraic transformation
• An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path
• An Infeasible-Interior-Point Method for Linear Complementarity Problems

This page was built for publication: A new infeasible interior-point algorithm for linear complementarity problem

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