scientific article; zbMATH DE number 4131946
From MaRDI portal
Publication:3033554
Recommendations
- Linear Programming in O([n3/ln n]L) Operations
- A simple complexity proof for a polynomial-time linear programming algorithm
- 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 4062817
- A new polynomial-time algorithm for linear programming
Cited in
(37)- Solving related two- and three-dimensional linear programming problems in logarithmic time
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
- On the convergence of the affine-scaling algorithm
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- An interior point method, based on rank-1 updates, for linear programming
- An O(n^ 3 L) primal-dual potential reduction algorithm for solving convex quadratic programs
- Finding an interior point in the optimal face of linear programs
- A globally convergent primal-dual interior point algorithm for convex programming
- Primal-dual algorithms for linear programming based on the logarithmic barrier method
- Long-step strategies in interior-point primal-dual methods
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming
- Exploiting special structure in a primal-dual path-following algorithm
- An interior point potential reduction method for constrained equations
- A simple complexity proof for a polynomial-time linear programming algorithm
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
- An exterior point polynomial-time algorithm for convex quadratic programming
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
- An entire space polynomial-time algorithm for linear programming
- PageRank optimization by edge selection
- scientific article; zbMATH DE number 4199965 (Why is no real title available?)
- scientific article; zbMATH DE number 4059112 (Why is no real title available?)
- scientific article; zbMATH DE number 4062817 (Why is no real title available?)
- Linear Programming in O([n3/ln n]L) Operations
- scientific article; zbMATH DE number 1383149 (Why is no real title available?)
- scientific article; zbMATH DE number 916038 (Why is no real title available?)
- Simultaneous perception-action design via invariant finite belief sets
- A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming
- IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga
- Gradient preserving operator inference: data-driven reduced-order models for equations with gradient structure
- New interior-point algorithm for linear optimization based on a universal tangent direction
- An active-set strategy in an interior point method for linear programming
- A scaling technique for finding the weighted analytic center of a polytope
- On the finite convergence of interior-point algorithms for linear programming
- Convergence behavior of interior-point algorithms
- Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming
- A quadratically convergent method for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033554)
