Abstract- We investigate the functions of given approximation order L that have the smallest support. Those are shown to be linear combinations of the Bspline of degree .L - 1 and ...
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
From the recovery of structure from motion to the separation of style and content, many problems in computer vision have been successfully approached by using bilinear models. The...
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...