Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems

DOI10.1016/j.amc.2010.03.015zbMath1191.65068OpenAlexW2035193411MaRDI QIDQ979273

Mohamed Achache

Publication date: 25 June 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.03.015

zbMATH Keywords

linear complementarity problemsinterior point methodspolynomial complexityprimal-dual algorithmsnumerical implementation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Related Items (20)

Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation ⋮ A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs ⋮ A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS ⋮ Complexity analysis of a full-{N}ewton step interior-point method for linear optimization ⋮ A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems ⋮ A wide-neighborhood predictor-corrector interior-point algorithm for linear complementarity problems ⋮ Solving nonmonotone affine variational inequalities problem by DC programming and DCA ⋮ A corrector-predictor interior-point method with new search direction for linear optimization ⋮ Unnamed Item ⋮ New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function ⋮ A generalized direction in interior point method for monotone linear complementarity problems ⋮ New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP ⋮ A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions ⋮ New method for determining search directions for interior-point algorithms in linear optimization ⋮ Unnamed Item ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique ⋮ Unnamed Item ⋮ Path-following interior-point algorithm for monotone linear complementarity problems

Cites Work

• A new primal-dual path-following method for convex quadratic programming
• A numerical study of an infeasible primal-dual path-following algorithm for linear programming
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems