Pasar al contenido principal

OPTIMIZACION VARIACIONAL: ESTRUCTURA Y DUALIDAD

MTM2011-29064-C03-01

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2011
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSIDAD AUTONOMA DE BARCELONA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The Voronoi inverse mapping

  • Goberna, Miguel A.
  • Martínez Legaz, Juan Enrique
  • Vera de Serio, Virginia N.
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
Given an arbitrary set T in the Euclidean space whose elements are called sites, and a particular site s, the Voronoi cell of s , denoted by VT(s)VT(s), consists of all points closer to s than to any other site. The Voronoi mapping of s , denoted by ψsψs, associates to each set T∋sT∋s the Voronoi cell VT(s)VT(s) of s w.r.t. T . These Voronoi cells are solution sets of linear inequality systems, so they are closed convex sets. In this paper we study the Voronoi inverse problem consisting in computing, for a given closed convex set F∋sF∋s, the family of sets T∋sT∋s such that ψs(T)=Fψs(T)=F. More in detail, the paper analyzes relationships between the elements of this family, ψs−1(F), and the linear representations of F , provides explicit formulas for maximal and minimal elements of ψs−1(F), and studies the closure operator that assigns, to each closed set T containing s , the largest element of ψs−1(F), where F=VT(s)F=VT(s).
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Motzkin decomposition of closed convex sets via truncation

  • Goberna, Miguel A.
  • Iusem, Alfredo Noel
  • Martínez Legaz, Juan Enrique
  • Todorov, Maxim I.
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
A nonempty set F is called Motzkin decomposable when it can be expressed as the Minkowski sum of a compact convex set C with a closed convex cone D. In that case, the sets C and D are called compact and conic components of F. This paper provides new characterizations of the Motzkin decomposable sets involving truncations of F (i.e., intersections of FF with closed halfspaces), when F contains no lines, and truncations of the intersection F̂ of F with the orthogonal complement of the lineality of F, otherwise. In particular, it is shown that a nonempty closed convex set F is Motzkin decomposable if and only if there exists a hyperplane H parallel to the lineality of F such that one of the truncations of F̂ induced by H is compact whereas the other one is a union of closed halflines emanating from H. Thus, any Motzkin decomposable set F can be expressed as F=C+D, where the compact component C is a truncation of F̂. These Motzkin decompositions are said to be of type T when F contains no lines, i.e., when C is a truncation of F. The minimality of this type of decompositions is also discussed.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Lower semicontinuity of the feasible set mapping of linear systems relative to their domains

  • Daniilidis, Aris
  • Goberna, Miguel A.
  • López Cerdá, Marco A.
  • Lucchetti, Roberto
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
This paper deals with stability properties of the feasible set of linear inequality systems having a finite number of variables and an arbitrary number of constraints. Several types of perturbations preserving consistency are considered, affecting respectively, all of the data, the left-hand side data, or the right-hand side coefficients.