A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term

DOI10.1007/s12190-023-01858-8zbMath1522.90028OpenAlexW4366482859MaRDI QIDQ6046863

Safa Guerdouh, Wided Chikouche, Behrouz Kheirfam

Publication date: 6 October 2023

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-023-01858-8

zbMATH Keywords

kernel functionlinear optimizationcomplexity analysisfull-Newton stepinfeasible Interior-point methods

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (1)

Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Feasibility issues in a primal-dual interior-point method for linear programming
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• Interior path following primal-dual algorithms. I: Linear programming
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
• Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
• A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• Mathematical Methods of Organizing and Planning Production
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
• On the Implementation of a Primal-Dual Interior Point Method
• Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

This page was built for publication: A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term