The steepest descent gravitational method for linear programming

DOI10.1016/0166-218X(89)90002-4zbMath0691.90051MaRDI QIDQ583105

Soo Y. Chang, Katta G. Murty

Publication date: 1989

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

redundant constraints; descent gravitational directions; feasible directions; touching constraints

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C05: Linear programming

Related Items

Complexity of the gravitational method for linear programming, Exterior point algorithms for nearest points and convex quadratic programs, CP-rays in simplicial cones, A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization, Pivot rules for linear programming: A survey on recent theoretical developments, Chemical equation balancing: an integer programming approach, A gravitational interior point method for LP.

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• A polynomial Newton method for linear programming
• Karmarkar's algorithm and the ellipsoid method
• The gravitational method for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A variation on Karmarkar’s algorithm for solving linear programming problems
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Computational complexity of LCPs associated with positive definite symmetric matrices
• A critical index algorithm for nearest point problems on simplicial cones
• A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
• Finding the nearest point in A polytope
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints