An adaptive infeasible interior-point algorithm for linear complementarity problems

DOI10.1007/S40305-013-0031-XMaRDI QIDQ743784zbMATH OpenOpenAlexFDO

Authors Hossein Mansouri, M. Pirhaji

Publication date 30 September 2014

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-013-0031-x

zbMATH Keywords

linear complementarity problempolynomial complexitycentral pathinfeasible-interior-point-method

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 algorithm for linear complementarity problem
• A new infeasible interior-point method for linear complementarity problem based on full Newton step
• An Infeasible-Interior-Point Method for Linear Complementarity Problems
• An infeasible-interior-point algorithm for linear complementarity problems
• An infeasible interior-point algorithm for linear complementarity problem based on a kernel function

Cites work

• scientific article; zbMATH DE number 4147426 (Why is no real title available?)
• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• scientific article; zbMATH DE number 4072729 (Why is no real title available?)
• scientific article; zbMATH DE number 1862745 (Why is no real title available?)
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
• A polynomial interior-point algorithm for monotone linear complementarity problems
• A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
• A unified approach to interior point algorithms for linear complementary problems
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
• Feasibility issues in a primal-dual interior-point method for linear programming
• Improved infeasible-interior-point algorithm for linear complementarity problerns
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On a homogeneous algorithm for the monotone complementarity problem
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Polynomial interior-point algorithms for P_*( ) horizontal linear complementarity problem
• Self-regular functions and new search directions for linear and semidefinite optimization
• Test examples for nonlinear programming codes

Cited in

(2)

• An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
• A potential reduction method for tensor complementarity problems

This page was built for publication: An adaptive infeasible interior-point algorithm for linear complementarity problems

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