A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
From MaRDI portal
Publication:6166934
DOI10.1007/s10100-022-00812-6OpenAlexW3206468351WikidataQ114228505 ScholiaQ114228505MaRDI QIDQ6166934
Marianna. E.-Nagy, Anita Varga
Publication date: 4 August 2023
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-022-00812-6
mathematical programminginterior point algorithmslinear optimizationalgebraic equivalent transformation technique
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- A new polynomial-time algorithm for linear programming
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- Finding an interior point in the optimal face of linear programs
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- A corrector-predictor interior-point method with new search direction for linear optimization
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- Linear programming using MATLAB
- A Mathematical View of Interior-Point Methods in Convex Optimization
- A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- The theory of linear programming:skew symmetric self-dual problems and the central path*
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
