A new search direction for full-Newton step infeasible interior-point method in linear optimization
From MaRDI portal
Publication:6202360
DOI10.17535/CRORR.2023.0016arXiv2102.07223MaRDI QIDQ6202360FDOQ6202360
Authors: Behrouz Kheirfam 
Publication date: 26 March 2024
Published in: Croatian operational research review (Search for Journal in Brave)
Abstract: In this paper, we study an infeasible interior-point method for linear optimization with full-Newton step. The introduced method uses an algebraic equivalent transformation on the centering equation of the system which defines the central path. We prove that the method finds an -optimal solution of the underlying problem in polynomial time.
Full work available at URL: https://arxiv.org/abs/2102.07223
Cites Work
- A new polynomial-time algorithm for linear programming
- Self-regular functions and new search directions for linear and semidefinite optimization
- Title not available (Why is that?)
- 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
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem
- An improved and simplified full-Newton step \(O(n)\) infeasible interior-point method for linear optimization
- A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- Feasibility issues in a primal-dual interior-point method for linear programming
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming
- Title not available (Why is that?)
- New interior point algorithms in linear programming
- Title not available (Why is that?)
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
- A new primal-dual path-following method for convex quadratic programming
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- An infeasible full-NT step interior point algorithm for CQSCO
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- 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 full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
- An improved and modified infeasible interior-point method for symmetric optimization
Cited In (2)
This page was built for publication: A new search direction for full-Newton step infeasible interior-point method in linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202360)
