Differential-algebraic approach to linear programming

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A new polynomial-time algorithm for linear programming
Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
A potential-reduction variant of Renegar's short-step path-following method for linear programming
An \(O(n^ 3L)\) potential reduction algorithm for linear programming
``Neural computation of decisions in optimization problems
On the stability of the travelling salesman problem algorithm of Hopfield and Tank
Solving a combinatorial problem via self-organizing process: An application of the Kohonen algorithm to the traveling salesman problem
Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
Interior path following primal-dual algorithms. I: Linear programming
A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
Linear programming, recurrent associative memories, and feed-forward neural networks
The Guilty net for the traveling salesman problem
Recurrent neural networks for linear programming: Analysis and design principles
Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
Extensions of the potential reduction algorithm for linear programming
A deterministic annealing neural network for convex programming
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
Analysis and design of a recurrent neural network for linear programming

This page was built for publication: Differential-algebraic approach to linear programming