scientific article; zbMATH DE number 3561096
From MaRDI portal
Publication:4132018
zbMath0359.90062MaRDI QIDQ4132018
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Polytopes and polyhedra (52Bxx)
Related Items
On the closest point to the origin in transportation polytopes, Pseudoconvex optimization for a special problem of paint industry, Improving feasible directions for a class of nondifferentiable functions, Quadratic problems defined on a convex hull of points, Smallest point of a polytope, Some n by dn linear complementarity problems, An algorithm for linearly constrained nonlinear programming problems, A survey on the continuous nonlinear resource allocation problem, A gravitational interior point method for LP., Finding the nearest point in A polytope, Equivalence of some quadratic programming algorithms, The distance between two convex sets, The steepest descent gravitational method for linear programming, An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality, A logarithmic descent direction algorithm for the quadratic knapsack problem, Algorithmic equivalence in quadratic programming. I. A least-distance programming problem, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential, Linearly constrained estimation by mathematical programming, Least-index resolution of degeneracy in quadratic programming, A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\), The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review, Algorithms for the solution of quadratic knapsack problems, Gauss-Seidel method for least-distance problems
