A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions.

Published in: Math. Oper. Res. (1983)

Keyphrases

optimal solution
dynamic programming
k means
objective function
expectation maximization
multiresolution
np hard
worst case
minimization problems
dc programming
computational complexity
semi supervised
convex functions