A new second-order corrector interior-point algorithm for P*(k)-LCP

DOI10.2298/FIL1720379KzbMath1499.90271OpenAlexW2798137688MaRDI QIDQ5023102

Behrouz Kheirfam, Maryam Chitsaz

Publication date: 20 January 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1720379k

zbMATH Keywords

linear complementarity probleminterior-point methodspolynomial complexitywide neighborhood\(P_\ast (\kappa)\) matrix

Mathematics Subject Classification ID

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

Related Items (3)

A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization ⋮ A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function

Cites Work

• Unnamed Item
• Corrector-predictor methods for sufficient linear complementarity problems
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• A new second-order corrector interior-point algorithm for semidefinite programming
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
• A Linear Complementarity Problem with a P-Matrix
• Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
• 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
• Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
• Complementarity problems

This page was built for publication: A new second-order corrector interior-point algorithm for P*(k)-LCP