A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
DOI10.1016/j.apnum.2018.11.001zbMath1471.65065OpenAlexW2899715963MaRDI QIDQ1633334
Zhengwei Huang, Beibei Yuan, Ming Wang Zhang
Publication date: 19 December 2018
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2018.11.001
polynomial complexityinterior-point algorithmarc-search\(P_\ast(\kappa)\) linear complementarity problem
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51) Numerical methods for variational inequalities and related problems (65K15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- A polynomial arc-search interior-point algorithm for linear programming
- A polynomial arc-search interior-point algorithm for convex quadratic programming
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- On the resolution of monotone complementarity problems
- Self-regular functions and new search directions for linear and semidefinite optimization
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Interior Point Methods for Linear Optimization
This page was built for publication: A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem
