A new search direction for full-Newton step infeasible interior-point method in linear optimization

DOI10.17535/crorr.2023.0016arXiv2102.07223MaRDI QIDQ6202360

Behrouz Kheirfam

Publication date: 26 March 2024

Published in: Croatian operational research review (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.07223

zbMATH Keywords

linear optimizationpolynomial complexityinfeasible interior-point methodsnew search directions

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
• A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
• A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
• A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
• An infeasible full-NT step interior point algorithm for CQSCO
• A new primal-dual path-following method for convex quadratic programming
• An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
• 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 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
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• Self-regular functions and new search directions for linear and semidefinite optimization
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
• A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
• A new infeasible interior-point method based on Darvay's technique for symmetric optimization
• An improved and modified infeasible interior-point method for symmetric optimization
• An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

This page was built for publication: A new search direction for full-Newton step infeasible interior-point method in linear optimization