A new search direction for full-Newton step infeasible interior-point method in linear optimization
From MaRDI portal
Publication:6202360
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.
Cites work
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 6913928 (Why is no real title available?)
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP
- 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 new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- A new polynomial-time algorithm for linear programming
- A new primal-dual path-following method for convex quadratic programming
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- 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
- An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem
- An infeasible full-NT step interior point algorithm for CQSCO
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Feasibility issues in a primal-dual interior-point method for linear programming
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- New interior point algorithms in linear programming
- New method for determining search directions for interior-point algorithms in linear optimization
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Self-regular functions and new search directions for linear and semidefinite optimization
- Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming
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)
