Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem

DOI10.1007/S12543-009-0033-XMaRDI QIDQ376771zbMATH OpenOpenAlexFDO

Authors Guoqiang Wang, Y. J. Yue, Xin-Zhong Cai

Publication date 19 November 2013

Published in Fuzzy Information and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12543-009-0033-x

zbMATH Keywords

interior-point methodsiteration boundmixed linear complementarity problemsmallupdate method

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A weighted-path-following method for monotone horizontal linear complementarity problem
• Path-following algorithms for monotone weighted complementarity problems
• A weighted-path-following method for symmetric cone linear complementarity problems
• A full-Newton step interior-point method for monotone weighted linear complementarity problems
• A weighted-path-following method for the linear complementarity problem

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 primal-dual path-following method for convex quadratic programming
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• A weighted-path-following method for linear optimization
• A weighted-path-following method for the linear complementarity problem
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• Equivaence between different formulations of the linear complementarity promblem
• Fast convergence of the simplified largest step path following algorithm
• Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
• New interior point algorithms in linear programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Primal-dual target-following algorithms for linear programming
• The largest step path following algorithm for monotone linear complementarity problems

Cited in

(12)

• A polynomial-time weighted path-following interior-point algorithm for linear optimization
• Path-following interior-point algorithm for monotone linear complementarity problems
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• A corrector-predictor interior-point method with new search direction for linear optimization
• A weighted-path-following method for symmetric cone linear complementarity problems
• Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
• A weighted-path-following method for monotone horizontal linear complementarity problem
• An implementing weighted path-following algorithm for linear complementarity problems
• A full-NT step infeasible interior-point algorithm for mixed symmetric cone LCPs
• Path-following algorithms for monotone weighted complementarity problems
• A weighted-path-following method for the linear complementarity problem
• Weighted-path-following algorithm for linear programming

This page was built for publication: Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem

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