The steepest descent gravitational method for linear programming
From MaRDI portal
Publication:583105
DOI10.1016/0166-218X(89)90002-4zbMATH Open0691.90051MaRDI QIDQ583105FDOQ583105
Authors: Soo Y. Chang, Katta G. Murty 
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Title not available (Why is that?)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A new polynomial-time algorithm for linear programming
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational complexity of LCPs associated with positive definite symmetric matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finding the nearest point in A polytope
- 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.
- Title not available (Why is that?)
- The gravitational method for linear programming
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- Title not available (Why is that?)
- A variation on Karmarkar’s algorithm for solving linear programming problems
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A modification of Karmarkar's linear programming algorithm
Cited In (15)
- Title not available (Why is that?)
- Chemical equation balancing: an integer programming approach
- A new practically efficient interior point method for LP
- A gravitational interior point method for LP.
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
- Title not available (Why is that?)
- Pivot rules for linear programming: A survey on recent theoretical developments
- The gravitational method for linear programming
- Fast descent methods for LPs with no matrix inversions
- CP-rays in simplicial cones
- Exterior point algorithms for nearest points and convex quadratic programs
- Projection onto simplicial cones by a semi-smooth Newton method
- Title not available (Why is that?)
- Complexity of the gravitational method for linear programming
- Complexity of the gravitational method for linear programming
Uses Software
This page was built for publication: The steepest descent gravitational method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583105)
