The following pages link to (Q4132018):
Displayed 21 items.
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) (Q1061617) (← links)
- Improving feasible directions for a class of nondifferentiable functions (Q1099079) (← links)
- Quadratic problems defined on a convex hull of points (Q1102708) (← links)
- Smallest point of a polytope (Q1117135) (← links)
- Some n by dn linear complementarity problems (Q1151241) (← links)
- An algorithm for linearly constrained nonlinear programming problems (Q1151830) (← links)
- An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality (Q1248461) (← links)
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem (Q1250029) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- Linearly constrained estimation by mathematical programming (Q1262209) (← links)
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review (Q1312749) (← links)
- Gauss-Seidel method for least-distance problems (Q1321271) (← links)
- Pseudoconvex optimization for a special problem of paint industry (Q1342653) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- A gravitational interior point method for LP. (Q2476413) (← links)
- The distance between two convex sets (Q2497250) (← links)
- Equivalence of some quadratic programming algorithms (Q3343781) (← links)
- Least-index resolution of degeneracy in quadratic programming (Q3902831) (← links)
- Finding the nearest point in A polytope (Q4123085) (← links)