A self-adjusting interior point algorithm for linear complementarity problems

DOI10.1016/J.CAMWA.2005.03.002MaRDI QIDQ814067zbMATH OpenOpenAlexFDO

Authors Suyan He, Shaohua Pan, Xingsi Li

Publication date 2 February 2006

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2005.03.002

zbMATH Keywords

linear complementarity problemscentral pathinterior point algorithmproximity measureself-adjusting

Mathematics Subject Classification ID

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

Recommendations

• An aggregate-function-based self-adjusting interior point algorithm for solving linear complementarity problems
• A self-adjusting primal–dual interior point method for linear programs
• scientific article; zbMATH DE number 1326028
• An Infeasible-Interior-Point Method for Linear Complementarity Problems
• A modified potential reduction algorithm for linear complementarity problems

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A new and efficient large-update interior-point method for linear optimization
• A self-adjusting primal–dual interior point method for linear programs
• Complementarity problems
• Constant potential primal-dual algorithms: A framework
• Solving the Nonlinear Complementarity Problem by a Homotopy Method
• Superlinear primal-dual affine scaling algorithms for LCP
• The global linear convergence of a noninterior path-following algorithm for linear complementarity problems
• User'S guide To Lipsol linear-programming interior point solvers V0.4

Cited in

(6)

• A self-adjusting primal–dual interior point method for linear programs
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
• An aggregate-function-based self-adjusting interior point algorithm for solving linear complementarity problems
• Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
• A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
• Complementarity problems in structural engineering: an overview

Describes a project that uses

Uses Software

• LIPSOL

This page was built for publication: A self-adjusting 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 Q814067)