Interior-point algorithm for linear programming based on a new descent direction
From MaRDI portal
Publication:6140958
DOI10.1051/ro/2023127MaRDI QIDQ6140958
Unnamed Author, Unnamed Author, Benterki Djamel, Unnamed Author
Publication date: 22 January 2024
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Cites Work
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- A full-Newton step interior-point algorithm based on modified Newton direction
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- A new primal-dual path-following method for convex quadratic programming
- New method for determining search directions for interior-point algorithms in linear optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
- A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- An ADMM-based interior-point method for large-scale linear programming
- A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
- A new full-NT step interior-point method for circular cone optimization
- A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
- A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Interior-point algorithm for linear programming based on a new descent direction