Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
From MaRDI portal
Publication:2162530
DOI10.1007/s10589-022-00385-9zbMath1496.90033OpenAlexW4283825171WikidataQ114227016 ScholiaQ114227016MaRDI QIDQ2162530
Publication date: 8 August 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-022-00385-9
linear programminginterior point methodssearch directionsmultidimensional searchestwo-dimensional search algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- Infeasible interior-point methods for linear optimization based on large neighborhood
- A polynomial arc-search interior-point algorithm for linear programming
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- Interior point methods 25 years later
- A modification of Karmarkar's linear programming algorithm
- The double pivot simplex method
- Convergence behavior of interior-point algorithms
- New method for determining search directions for interior-point algorithms in linear optimization
- A new polynomial-time algorithm for linear programming
- Optimizing over three-dimensional subspaces in an interior-point method for linear programming
- The life and work of André Cholesky
- Further development of multiple centrality correctors for interior point methods
- On the convergence of the affine-scaling algorithm
- Pivot rules for linear programming: A survey on recent theoretical developments
- A simplified global convergence proof of the affine scaling algorithm
- A primal-dual infeasible-interior-point algorithm for linear programming
- Piecewise linear programming via interior points
- Pivot versus interior point methods: Pros and cons
- Multiple centrality corrections in a primal-dual method for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- The many facets of linear programming
- Postponing the choice of penalty parameter and step length
- A simple proof of a primal affine scaling method
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- Optimized choice of parameters in interior-point methods for linear programming
- Search directions for interior linear-programming methods
- Global Optimization with Polynomials and the Problem of Moments
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- On the Implementation of a Primal-Dual Interior Point Method
- Path-Following Methods for Linear Programming
- Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- PCx: an interior-point code for linear programming
- Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Linear programming. Foundations and extensions
- An efficient search direction for linear programming problems
This page was built for publication: Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
