On the finite convergence of interior-point algorithms for linear programming
From MaRDI portal
Publication:687096
DOI10.1007/BF01581087zbMath0794.90036DBLPjournals/mp/Ye92aOpenAlexW2063176644WikidataQ92952561 ScholiaQ92952561MaRDI QIDQ687096
Publication date: 20 December 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581087
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (30)
On the identification of the optimal partition for semidefinite optimization ⋮ A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming ⋮ Asymptotic convergence in a generalized predictor-corrector method ⋮ A primal-dual interior point method whose running time depends only on the constraint matrix ⋮ Unnamed Item ⋮ Solving linear systems involved in constrained optimization ⋮ Interior-point methods for nonlinear complementarity problems ⋮ Finite termination of a Newton-type algorithm for a class of affine variational inequality problems ⋮ Towards an efficient augmented Lagrangian method for convex quadratic programming ⋮ A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods ⋮ Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization ⋮ Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem ⋮ On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities ⋮ Fortran subroutines for network flow optimization using an interior point algorithm ⋮ On the accurate identification of active set for constrained minimax problems ⋮ An easy way to teach interior-point methods. ⋮ Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices ⋮ Improved complexity results on solving real-number linear feasibility problems ⋮ Symbolic implementation of interior point method for linear programming problem ⋮ Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity ⋮ A rounding procedure for semidefinite optimization ⋮ Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem ⋮ Une procédure de purification pour les problèmes de complémentarité linéaire, monotones ⋮ A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution ⋮ A new class of polynomial primal-dual methods for linear and semidefinite optimization ⋮ Degeneracy in interior point methods for linear programming: A survey ⋮ A quantum interior-point predictor–corrector algorithm for linear programming ⋮ Finding an interior point in the optimal face of linear programs ⋮ On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems ⋮ Active-set prediction for interior point methods using controlled perturbations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence behavior of interior-point algorithms
- A new polynomial-time algorithm for linear programming
- A ``build-down scheme for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Determining basic variables of optimal solutions in Karmarkar's new LP algorithm
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- On finding a vertex solution using interior point methods
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- A geometric view of parametric linear programming
- Finding an interior point in the optimal face of linear programs
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- On Finding Primal- and Dual-Optimal Bases
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
This page was built for publication: On the finite convergence of interior-point algorithms for linear programming
