Polynomial affine algorithms for linear programming
From MaRDI portal
Recommendations
- A new polynomial-time algorithm for linear programming
- scientific article; zbMATH DE number 4016589
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- scientific article; zbMATH DE number 4068603
- On the convergence of the affine-scaling algorithm
Cites work
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- A Centered Projective Algorithm for Linear Programming
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Conical projection algorithms for linear programming
Cited in
(37)- Interior-point algorithms for semi-infinite programming
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- Nonlinear coordinate representations of smooth optimization problems
- scientific article; zbMATH DE number 910007 (Why is no real title available?)
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- A polynomial method of approximate centers for linear programming
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- Polynomial algorithms for linear programming over the algebraic numbers
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- Degeneracy in interior point methods for linear programming: A survey
- Pure adaptive search in global optimization
- A combined phase I-phase II scaled potential algorithm for linear programming
- scientific article; zbMATH DE number 913271 (Why is no real title available?)
- An affine-scaling pivot algorithm for linear programming
- Combining phase I and phase II in a potential reduction algorithm for linear programming
- A polynomial Newton method for linear programming
- scientific article; zbMATH DE number 4064763 (Why is no real title available?)
- A class of polynomial variable metric algorithms for linear optimization
- Synthesis for Polynomial Lasso Programs
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- New complexity results for the Iri-Imai method
- An O(n^ 3 L) primal-dual potential reduction algorithm for solving convex quadratic programs
- An interior point potential reduction algorithm for the linear complementarity problem
- Convergence property of the Iri-Imai algorithm for some smooth convex programming problems
- On the convergence of primal-dual interior-point methods with wide neighborhoods
- Comparative analysis of affine scaling algorithms based on simplifying assumptions
- On lower bound updates in primal potential reduction methods for linear programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- A note to the paper An efficient algorithm for linear programming of V. Ch. Venkaiah
- Potential-reduction methods in mathematical programming
- A survey of search directions in interior point methods for linear programming
- Interior point algorithms for linear programming with inequality constraints
- A combinatorial interior point method for network flow problems
- Large step volumetric potential reduction algorithms for linear programming
- scientific article; zbMATH DE number 4181141 (Why is no real title available?)
- A polynomial-time algorithm for affine variational inequalities
This page was built for publication: Polynomial affine algorithms for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814590)
