A generalized direction in interior point method for monotone linear complementarity problems
From MaRDI portal
Publication:1733321
DOI10.1007/s11590-018-1241-2zbMath1417.90138OpenAlexW2515697160MaRDI QIDQ1733321
Mounir Haddou, Jérémy Omer, Tangi Migot
Publication date: 21 March 2019
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-018-1241-2
linear programminglinear complementarity problemsinterior-point methodsconcave functionspolynomial time complexity
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations, Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction, Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique, Path-following interior-point algorithm for monotone linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- A new primal-dual path-following method for convex quadratic programming
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Smoothing methods for nonlinear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones
- An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
- A Corrector-Predictor Interior-Point Algorithm for P∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones
- An infeasible interior-point method with improved centering steps for monotone linear complementarity problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Smoothing Method for Sparse Optimization over Polyhedral Sets
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Interior Point Methods for Linear Optimization
