Dipòsit Digital de Documents de la UAB 5 registres trobats  La cerca s'ha fet en 0.00 segons. 
1.
18 p, 302.4 KB On farthest Voronoi cells / Goberna, Miguel Ángel (Universitat d'Alacant) ; Martínez Legaz, Juan Enrique (Universitat Autònoma de Barcelona) ; Todorov, Maxim (Universidad de las Américas Puebla)
Given an arbitrary set T in the Euclidean space Rn, whose elements are called sites, and a particular site s, the farthest Voronoi cell of s, denoted by FT(s), consists of all points which are farther from s than from any other site. [...]
2019 - 10.1016/j.laa.2019.09.002
Linear Algebra and its Applications, Vol. 583 (December 2019) , p. 306-322  
2.
29 p, 554.8 KB On the structure of higher order Voronoi cells / Martínez Legaz, Juan Enrique (Universitat Autònoma de Barcelona) ; Roshchina, Vera (University of New South Wales (Australia)) ; Todorov, Maxim (Universidad de las Américas Puebla)
The classic Voronoi cells can be generalized to a higher order version by considering the cells of points for which a given k-element subset of the set of sites consists of the k closest sites. We study the structure of the k-order Voronoi cells and illustrate our theoretical findings with a case study of two-dimensional higher order Voronoi cells for four points.
2019 - 10.1007/s10957-019-01555-2
Journal of optimization theory and applications, Vol. 183 (2019) , p. 24-49  
3.
16 p, 444.8 KB γ-Active constraints in convex semi-infinite programming / Martínez Legaz, Juan Enrique (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica) ; Todorov, Maxim Ivanov (Universidad de las Américas) ; Zetina, Carlos Armando (Universidad de las Américas)
In this article, we extend the definition of γ-active constraints for linear semi-infinite programming to a definition applicable to convex semi-infinite programming, by two approaches. The first approach entails the use of the subdifferentials of the convex constraints at a point, while the second approach is based on the linearization of the convex inequality system by means of the convex conjugates of the defining functions. [...]
2014 - 10.1080/01630563.2014.895745
Numerical Functional Analysis and Optimization, Vol. 35, Núm. 7-9 (2014) , p. 1078-1094  
4.
15 p, 319.5 KB Motzkin predecomposable sets / Iusem, N. (Instituto de Matemática Pura e Aplicada (Rio de Janeiro, Brasil)) ; Martínez Legaz, Juan Enrique (Universitat Autònoma de Barcelona. Departament d'Economia i d'Història Econòmica) ; Todorov, Maxim Ivanov (Universidad de las Américas. Departmento de Actuaría y Matemáticas)
We introduce and study the family of sets in a finite dimensional Euclidean space which can be written as the Minkowski sum of a compact and convex set and a convex cone (not necessarily closed). We establish several properties of the class of such sets, called Motzkin predecomposable, some of which hold also for the class of Motzkin decomposable sets (i. [...]
2014 - 10.1007/s10898-013-0097-3
Journal of Global Optimization, Vol. 60, Núm. 4 (2014) , pp. 635-647  
5.
9 p, 429.8 KB Relaxation methods for solving linear inequality systems: Converging results / González-Gutiérrez, E. ; Hernández Rebollar, Lídia Aurora ; Todorov, Maxim I. ; Centre de Recerca Matemàtica
The problem of finding a feasible solution to a linear inequality system arises in numerous contexts. In [12] an algorithm, called extended relaxation method, that solves the feasibility problem, has been proposed by the authors. [...]
Centre de Recerca Matemàtica 2010 (Prepublicacions del Centre de Recerca Matemàtica ; 990)  

Vegeu també: autors amb noms similars
1 Todorov, M. I.
1 Todorov, Maxim I.
2 Todorov, Maxim Ivanov
Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.