A new polynomial-time algorithm for linear programming

Recommendations

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 938987
A polynomial-time algorithm, based on Newton's method, for linear programming
scientific article; zbMATH DE number 4119927

Cites work

scientific article; zbMATH DE number 3644821 (Why is no real title available?)
scientific article; zbMATH DE number 3059981 (Why is no real title available?)
The ellipsoid method and its consequences in combinatorial optimization

Cited in

(only showing first 100 items - show all)

An interior point potential reduction method for constrained equations
Structure-exploiting interior point methods
Identifying an optimal basis in linear programming
A simple direct cosine simplex algorithm
A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization
Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem
Smoothed analysis of condition numbers and complexity implications for linear programming
Linear programming: recent advances
A fast and efficient implementation of qualitatively constrained quantile smoothing splines
On detecting nonlinear patterns in discriminant problems
Computing projections for the Karmarkar algorithm
Vector forecasting and dynamic portfolio selection: Empirical efficiency of recursive multiperiod strategies
A continuation method for solving convex programming problemsviafischer reformulation
Using aspiration levels in an interactive interior multiobjective linear programming algorithm
Interior-point methods
Projection algorithms for linear programming
An affine scaling method for solving network flow problems
A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
An interior-point algorithm for nonlinear minimax problems
An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
Norm estimations for perturbations of the weighted Moore-Penrose inverse
Symbolic model checking of timed guarded commands using difference decision diagrams
Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
Complexity aspects of a semi-infinite optimization problem†
Multicommodity network flows: A survey. II: Solution methods
Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
Classification by polynomial surfaces
A strongly polynomial algorithm for linear systems having a binary solution
Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
A reduced-gradient variant of Karmarkar's algorithm and null-space projections
Karmarkar's algorithm and its place in applied mathematics
A projective method for linear programming with box-type constraints
Optimization algorithms
A long-step, cutting plane algorithm for linear and convex programming
Interior-point algorithms for semi-infinite programming
An affine scaling method using a class of differential barrier functions: primal approach
Perturbation bounds for the metric projection of a point onto a linear manifold in reflexive strictly convex Banach spaces
Extending interior-point methods to nonlinear second-order cone programming: application to finite-strain elastoplasticity
A convex analysis view of the barrier problem
New technique for solving primal all-integer linear programming
Plastic collapse analysis of Mindlin-Reissner plates using a composite mixed finite element
A powerful force-based approach for the limit analysis of three-dimensional frames
Convex optimization with an interpolation-based projection and its application to deep learning
An iterative rounding 2-approximation algorithm for the k-partial vertex cover problem
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
Solving symmetric indefinite systems in an interior-point method for linear programming
Towards a computationally tractable maximum entropy principle for nonstationary financial time series
A predictor-corrector algorithm for linear optimization based on a modified Newton direction
scientific article; zbMATH DE number 14735 (Why is no real title available?)
The double pivot simplex method
Using central prices in the decomposition of linear programs
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
An interior multiobjective linear programming algorithm
On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
Synthesis of (choice-free) reset nets
Lagrangian transformation and interior ellipsoid methods in convex optimization
An interior point algorithm for semi-infinite linear programming
Robust convex conic optimization in D-induced duality framework
A randomized polynomial-time simplex algorithm for linear programming
Randomized interior point methods for sampling and optimization
Generation of interior points and polyhedral representations of cones in R^N cut by M planes sharing a common point
An improved full-Newton step O(n) infeasible interior-point method for horizontal linear complementarity problem
A new predictor-corrector method for optimal power flow
Interior point methods 25 years later
An algorithmic separating hyperplane theorem and its applications
A dynamic large-update primal‐dual interior-point method for linear optimization
The _1 solution of linear inequalities
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
A potential-reduction algorithm for linear complementarity problems
New Gromov-inspired metrics on phylogenetic tree space
A simple polynomial-time rescaling algorithm for solving linear programs
Robust vertex enumeration for convex hulls in high dimensions
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions
Minimizing maximum delivery completion time for order scheduling with rejection
Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points
Asymptotics of the regression quantile basic solution under misspecification.
Bayesian quantile regression for longitudinal count data
Nonlinear coordinate representations of smooth optimization problems
Using the primal-dual interior point algorithm within the branch-price-and-cut method
Inverse barriers and CES-functions in linear programming
A finite steps algorithm for solving convex feasibility problems
A hybrid algorithm for the solution of a single commodity spatial equilibrium model
Differential-algebraic approach to linear programming
An LP-based successive overrelaxation method for linear complementarity problems
A New Approach to the Splitting Factor Preconditioner Applied to Linear Programming Problems
Solving a two-stage stochastic capacitated location-allocation problem with an improved PSO in emergency logistics
Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function
Probing a set of hyperplanes by lines and related problems
On the chaotic behavior of the primal-dual affine-scaling algorithm for linear optimization
An efficient logarithmic barrier method without line search for convex quadratic programming
A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
A new family of exponential LP problems
Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks
A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
An exact approach for the multi-depot electric bus scheduling problem with time windows
Interior point method: history and prospects
Reachability in timed automata with diagonal constraints

This page was built for publication: A new polynomial-time algorithm for linear programming

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