A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP

DOI10.1080/01630563.2019.1598430zbMath1420.90072OpenAlexW2939502752MaRDI QIDQ5379298

Publication date: 28 May 2019

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2019.1598430

zbMATH Keywords

interior-point methods polynomial complexity horizontal linear complementarity problem full-Newton step

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (2)

Interior-point algorithm for linear programming based on a new descent direction ⋮ An interior point method for $P_*(\kappa)$-horizontal linear complementarity problem based on a new proximity function

Cites Work

Unnamed Item
Unnamed Item
Corrector-predictor methods for sufficient linear complementarity problems
A new primal-dual path-following method for convex quadratic programming
Polynomial convergence of two higher order interior-point methods for $P_*(\kappa)$-LCP in a wide neighborhood of the central path
New method for determining search directions for interior-point algorithms in linear optimization
Polynomial interior-point algorithms for $P_*(\kappa )$ horizontal linear complementarity problem
A new polynomial-time algorithm for linear programming
A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient 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 quadratically convergent $\text{O}((\kappa +1)\sqrt n L)$-iteration algorithm for the $P_ *(\kappa)$-matrix linear complementarity problem
A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
A full-Newton step feasible interior-point algorithm for $P_\ast(\kappa)$-linear complementarity problems
A predictor-corrector interior-point algorithm for $P_\ast (\kappa )$-horizontal linear complementarity problem
Polynomial interior-point algorithm for $P_\ast(\kappa)$ horizontal linear complementarity problems
A new infeasible interior-point method based on Darvay's technique for symmetric optimization
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
A new second-order corrector interior-point algorithm for P*(k)-LCP
Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood 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: A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP