scientific article; zbMATH DE number 3561096

Cited in

(24)

A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
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
An algorithm for finding the shortest element of a polyhedral set with application to Lagrangian duality
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
Linearly constrained estimation by mathematical programming
The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
Gauss-Seidel method for least-distance problems
Pseudoconvex optimization for a special problem of paint industry
A logarithmic descent direction algorithm for the quadratic knapsack problem
A survey on the continuous nonlinear resource allocation problem
A gravitational interior point method for LP.
The distance between two convex sets
On the closest point to the origin in transportation polytopes
Equivalence of some quadratic programming algorithms
Least-index resolution of degeneracy in quadratic programming
Finding the nearest point in A polytope
The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
The steepest descent gravitational method for linear programming
Algorithms for the solution of quadratic knapsack problems

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)