Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP
From MaRDI portal
Publication:5198050
DOI10.1080/10556788.2018.1546857zbMath1429.90098OpenAlexW2906606693MaRDI QIDQ5198050
Florian A. Potra, Goran Lešaja
Publication date: 2 October 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2018.1546857
interior-point methodadaptive full Newton-stepinfeasible central pathsufficient horizontal linear complementarity problem
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
A full-Newton step interior-point method for monotone weighted linear complementarity problems, A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem, 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
Cites Work
- Unnamed Item
- Corrector-predictor methods for sufficient linear complementarity problems
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- Sufficient matrices and the linear complementarity problem
- 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
- \(P_ *\)-matrices are just sufficient
- High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
- An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
- Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
- Equivaence between different formulations of the linear complementarity promblem
- On the Convergence of the Iteration Sequence of Infeasible Path Following Algorithms for Linear Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
- Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- High order long-step methods for solving linear complementarity problems
