Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
We propose a unified data modeling approach that is equally applicable to supervised regression and classification applications, as well as to unsupervised probability density func...
Level set methods have been widely used in image processing and computer vision. In conventional level set formulations, the level set function typically develops irregularities du...
Chunming Li, Chenyang Xu, Changfeng Gui, Martin D....