A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
From MaRDI portal
Publication:2311198
DOI10.1007/s11590-018-1328-9zbMath1425.90116OpenAlexW2890366415MaRDI QIDQ2311198
Nesrine Tabchouche, Mohamed Achache
Publication date: 10 July 2019
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-018-1328-9
interior-point methodspolynomial complexityfull-Newton stephorizontal linear complementarity problems
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (3)
An interior-point algorithm for semidefinite least-squares problems. ⋮ A full-Newton step interior-point method for monotone weighted linear complementarity problems ⋮ Path-following interior-point algorithm for monotone linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
- A smoothing-type algorithm for absolute value equations
- A new primal-dual path-following method for convex quadratic programming
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- On unique solvability of the absolute value equation
- Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
- Absolute value equations
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Self-regular functions and new search directions for linear and semidefinite optimization
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
This page was built for publication: A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems