The steepest descent gravitational method for linear programming
From MaRDI portal
(Redirected from Publication:583105)
Recommendations
Cites work
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3850827 (Why is no real title available?)
- scientific article; zbMATH DE number 3868523 (Why is no real title available?)
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 3920182 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3528040 (Why is no real title available?)
- scientific article; zbMATH DE number 3561096 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3402375 (Why is no real title available?)
- A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
- A critical index algorithm for nearest point problems on simplicial cones
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- A polynomial Newton method for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Computational complexity of LCPs associated with positive definite symmetric matrices
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Finding the nearest point in A polytope
- Karmarkar's algorithm and the ellipsoid method
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- 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 I. Linear Constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The gravitational method for linear programming
Cited in
(15)- Complexity of the gravitational method for linear programming
- Complexity of the gravitational method for linear programming
- scientific article; zbMATH DE number 6147934 (Why is no real title available?)
- Chemical equation balancing: an integer programming approach
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
- A new practically efficient interior point method for LP
- A gravitational interior point method for LP.
- scientific article; zbMATH DE number 5369699 (Why is no real title available?)
- Pivot rules for linear programming: A survey on recent theoretical developments
- The gravitational method for linear programming
- CP-rays in simplicial cones
- Fast descent methods for LPs with no matrix inversions
- Exterior point algorithms for nearest points and convex quadratic programs
- Projection onto simplicial cones by a semi-smooth Newton method
- scientific article; zbMATH DE number 4112377 (Why is no real title available?)
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)
