Pages that link to "Item:Q583105"
From MaRDI portal
The following pages link to The steepest descent gravitational method for linear programming (Q583105):
Displaying 7 items.
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- CP-rays in simplicial cones (Q811413) (← links)
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization (Q881511) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- Projection onto simplicial cones by a semi-smooth Newton method (Q2341098) (← links)
- Chemical equation balancing: an integer programming approach (Q2476121) (← links)
- A gravitational interior point method for LP. (Q2476413) (← links)