A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation

DOI10.1007/S10100-022-00812-6OpenAlexW3206468351WikidataQ114228505 ScholiaQ114228505MaRDI QIDQ6166934FDOQ6166934

Authors: 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

Recommendations

• Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
• An adaptive long step interior point algorithm for linear optimization
• Interior-point algorithm for linear optimization based on a new search direction
• scientific article; zbMATH DE number 6401300
• A full-Newton step interior-point method based on a class of specific algebra transformation

zbMATH Keywords

mathematical programminginterior point algorithmslinear optimizationalgebraic equivalent transformation technique

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding an interior point in the optimal face of linear programs
• A mathematical view of interior-point methods in convex optimization
• Title not available (Why is that?)
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
• Title not available (Why is that?)
• An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
• Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
• New interior point algorithms in linear programming
• Title not available (Why is that?)
• A wide neighborhood infeasible-interior-point method with arc-search for linear programming
• A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
• A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
• Title not available (Why is that?)
• The theory of linear programming:skew symmetric self-dual problems and the central path^*
• Title not available (Why is that?)
• A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
• Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
• An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
• Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
• Linear programming using MATLAB
• A corrector-predictor interior-point method with new search direction for linear optimization
• Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction

Cited In (4)

• 60 years of OR in Slovenia: development from a first conference to a vibrant community
• Overview of Hungarian operations research based on the VOCAL 2022 conference
• A Hybrid Direction Algorithm with Long Step Rule for Linear Programming: Numerical Experiments
• A class of wide neighborhood interior-point algorithms based on the algebraic equivalent transformation technique with specific functions

This page was built for publication: A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation

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