Login / Signup
A Compact Algorithm for Computing the Stationary Point of a Quadratic Function Subject to Linear Constraints.
J. T. Betts
Published in:
ACM Trans. Math. Softw. (1980)
Keyphrases
</>
learning algorithm
quadratic function
objective function
dynamic programming
worst case
knapsack problem
optimal solution
pairwise
high dimensional
cost function
simulated annealing
sufficient conditions
stationary points