Differential-algebraic approach to linear programming

DOI10.1023/A:1016095904048MaRDI QIDQ1862190zbMATH OpenFDO

Authors Yanyan Li, Jun Wang, P. Wang, M. Xiong

Publication date 10 March 2003

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1016095904048

zbMATH Keywords

differential-algebraic equationsdynamic systemslinear programming

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Dual-primal algorithm for linear optimization
• Duality theorems and algorithms for linear programming in measure spaces
• An exterior-point method for linear programming problems
• scientific article; zbMATH DE number 1546510
• Introduction: New approaches to linear programming

Cites work

• ``Neural computation of decisions in optimization problems
• A deterministic annealing neural network for convex programming
• A new polynomial-time algorithm for linear programming
• A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
• 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
• Analysis and design of a recurrent neural network for linear programming
• Extensions of the potential reduction algorithm for linear programming
• Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• scientific article; zbMATH DE number 3809326 (Why is no real title available?)
• scientific article; zbMATH DE number 37929 (Why is no real title available?)
• scientific article; zbMATH DE number 4126998 (Why is no real title available?)
• Interior path following primal-dual algorithms. I: Linear programming
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• Linear programming, recurrent associative memories, and feed-forward neural networks
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• Recurrent neural networks for linear programming: Analysis and design principles
• 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
• Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
• The Guilty net for the traveling salesman problem
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
• Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods

Cited in

(4)

• Duality theorems and algorithms for linear programming in measure spaces
• On the construction of strong complementarity slackness solutions for DEA linear programming problems using a primal-dual interior-point method
• Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
• scientific article; zbMATH DE number 5152474 (Why is no real title available?)

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

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