An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
From MaRDI portal
Publication:2399607
DOI10.1007/s10288-016-0325-zzbMath1369.90175OpenAlexW2468126360MaRDI QIDQ2399607
Publication date: 24 August 2017
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-016-0325-z
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (5)
A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem ⋮ Stochastic numerical approach for solving second order nonlinear singular functional differential equation ⋮ An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones ⋮ A primal-dual interior-point algorithm with arc-search for semidefinite programming ⋮ A corrector-predictor arc search interior-point algorithm for symmetric optimization
Cites Work
- 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 full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A primal-dual infeasible-interior-point algorithm for linear programming
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
- A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- 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: An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems
