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

DOI10.1007/S12190-023-01858-8zbMATH Open1522.90028OpenAlexW4366482859MaRDI QIDQ6046863FDOQ6046863

Authors 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 functioncomplexity analysislinear optimizationfull-Newton stepinfeasible Interior-point methods

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 3069632 (Why is no real title available?)
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
• A new polynomial-time algorithm for linear programming
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function
• Feasibility issues in a primal-dual interior-point method for linear programming
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
• Interior path following primal-dual algorithms. I: Linear programming
• Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
• Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
• 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

Cited in

(5)

• A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions
• A full-Newton step infeasible interior point algorithm and its parameters analysis
• A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
• Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
• A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046863)