A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function

DOI10.1007/s11075-011-9530-1zbMath1263.65055OpenAlexW2012799950MaRDI QIDQ451811

Zhang Lipu, Bai Yanqin, Xu Yinghong

Publication date: 24 September 2012

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-011-9530-1

zbMATH Keywords

monotone linear complementarity problemscomplexity analysisinterior-point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Interior-point methods (90C51)

Related Items (8)

A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function ⋮ An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems ⋮ Linear complementarity model predictive control with limited iterations for box-constrained problems ⋮ An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function ⋮ An adaptive updating full-Newton step interior-point algorithm with modified Newton direction ⋮ A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP ⋮ An infeasible interior point method for the monotone SDLCP based on a transformation of the central path ⋮ An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

Cites Work

• Unnamed Item
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• A path following method for LCP with superlinearly convergent iteration sequence
• An infeasible-interior-point algorithm for linear complementarity problems
• Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• The Linear Complementarity Problem
• A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
• Homotopy Continuation Methods for Nonlinear Complementarity Problems
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones

This page was built for publication: A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function