scientific article; zbMATH DE number 3561096

Cited in

(24)

Finding the nearest point in A polytope
Least-index resolution of degeneracy in quadratic programming
Smallest point of a polytope
Gauss-Seidel method for least-distance problems
Improving feasible directions for a class of nondifferentiable functions
The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
Pseudoconvex optimization for a special problem of paint industry
On the closest point to the origin in transportation polytopes
The steepest descent gravitational method for linear programming
A gravitational interior point method for LP.
An algorithm for linearly constrained nonlinear programming problems
Some n by dn linear complementarity problems
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
Algorithms for the solution of quadratic knapsack problems
A survey on the continuous nonlinear resource allocation problem
The distance between two convex sets
The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
A logarithmic descent direction algorithm for the quadratic knapsack problem
Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
Linearly constrained estimation by mathematical programming
An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
Equivalence of some quadratic programming algorithms
Quadratic problems defined on a convex hull of points

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132018)