Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
From MaRDI portal
Publication:376771
DOI10.1007/s12543-009-0033-xzbMath1275.90110OpenAlexW2058571734MaRDI QIDQ376771
Yu-Jing Yue, Guo-Qiang Wang, 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
Related Items (3)
A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new primal-dual path-following method for convex quadratic programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Fast convergence of the simplified largest step path following algorithm
- The largest step path following algorithm for monotone linear complementarity problems
- Primal-dual target-following algorithms for linear programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Equivaence between different formulations of the linear complementarity promblem
- Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
This page was built for publication: Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
