Pasar al contenido principal

ANALISIS VARIACIONAL Y DIFERENCIACION GENERALIZADA EN OPTIMIZACION CONVEXA Y TEMAS RELACIONADOS

MTM2008-06695-C03-02

•
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 2008
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 MIGUEL HERNANDEZ DE ELCHE
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)

On stable uniqueness in linear semi-infinite optimization

  • Goberna, Miguel A.
  • Todorov, Maxim I.
  • Vera de Serio, Virginia N.
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
This paper is intended to provide conditions for the stability of the strong uniqueness of the optimal solution of a given linear semi-infinite optimization (LSIO) problem, in the sense of maintaining the strong uniqueness property under sufficiently small perturbations of all the data. We consider LSIO problems such that the family of gradients of all the constraints is unbounded, extending earlier results of Nürnberger for continuous LSIO problems, and of Helbig and Todorov for LSIO problems with bounded set of gradients. To do this we characterize the absolutely (affinely) stable problems, i.e., those LSIO problems whose feasible set (its affine hull, respectively) remains constant under sufficiently small perturbations.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Distance to ill-posedness for linear inequality systems under block perturbations: convex and infinite-dimensional cases

  • Cánovas Cánovas, María Josefa
  • López Cerdá, Marco A.
  • Parra López, Juan
  • Toledo, Francisco Javier
This article extends some results of Cánovas et al. [M.J. Cánovas, M.A. López, J. Parra, and F.J. Toledo, Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems, Math. Prog. Ser. A 103 (2005), pp. 95–126.] about distance to ill-posedness (feasibility/infeasibility) in three directions: from individual perturbations of inequalities to perturbations by blocks, from linear to convex inequalities and from finite- to infinite-dimensional (Banach) spaces of variables. The second of the referred directions, developed in the finite-dimensional case, was the original motivation of this article. In fact, after linearizing a convex system via the Fenchel–Legendre conjugate, affine perturbations of convex inequalities translate into block perturbations of the corresponding linearized system. We discuss the key role played by constant perturbations as an extreme case of block perturbations. We emphasize the fact that constant perturbations are enough to compute the distance to ill-posedness in the infinite-dimensional setting, as shown in the last part of this article, where some remarkable differences of infinite- versus finite-dimensional systems are presented. Throughout this article, the set indexing the constraints is arbitrary, with no topological structure. Accordingly, the functional dependence of the system coefficients on the index has no qualification at all.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Voronoi cells via linear inequality systems

  • Goberna, Miguel A.
  • Rodríguez Álvarez, Margarita
  • Vera de Serio, Virginia N.
  • Rodríguez Álvarez, Margarita|||/items/81d9e7c1-c8aa-48b0-b6c7-5a4bd3e26327
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
The theory and methods of linear algebra are a useful alternative to those of convex geometry in the framework of Voronoi cells and diagrams, which constitute basic tools of computational geometry. As shown by Voigt and Weis in 2010, the Voronoi cells of a given set of sites T, which provide a tesselation of the space called Voronoi diagram when T is finite, are solution sets of linear inequality systems indexed by T. This paper exploits systematically this fact in order to obtain geometrical information on Voronoi cells from sets associated with T (convex and conical hulls, tangent cones and the characteristic cones of their linear representations). The particular cases of T being a curve, a closed convex set and a discrete set are analyzed in detail. We also include conclusions on Voronoi diagrams of arbitrary sets.