Pasar al contenido principal

AVANCES EN OPTIMIZACION CONVEXA: FUNDAMENTOS, METODOS Y APLICACIONES

MTM2008-06695-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 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 DE ALICANTE
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

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

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

Stability in linear optimization and related topics. A personal tour

  • López Cerdá, Marco A.
This paper is a kind of biased survey of the most representative and recent results on stability for the linear optimization problem. Qualitative and quantitative approaches are considered in this survey, and some infinite-dimensional extensions of the main results to more general problems are also included. In particular the paper deals with the lower/upper semicontinuity of the feasible/optimal set mappings, different types of ill-posedness, distance to ill-posedness, Lipschitz properties of these mappings under different types of perturbations, and estimates of the associated Lipschitz bounds.
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)

Quantitative stability of linear infinite inequality systems under block perturbations with applications to convex systems

  • Cánovas Cánovas, María Josefa
  • López Cerdá, Marco A.
  • Mordukhovich, Boris S.
  • Parra López, Juan
The original motivation for this paper was to provide an efficient quantitative analysis of convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional (resp. finite-dimensional) Banach spaces and that are indexed by an arbitrary fixed set J. Parameter perturbations on the right-hand side of the inequalities are required to be merely bounded, and thus the natural parameter space is l ∞(J). Our basic strategy consists of linearizing the parameterized convex system via splitting convex inequalities into linear ones by using the Fenchel–Legendre conjugate. This approach yields that arbitrary bounded right-hand side perturbations of the convex system turn on constant-by-blocks perturbations in the linearized system. Based on advanced variational analysis, we derive a precise formula for computing the exact Lipschitzian bound of the feasible solution map of block-perturbed linear systems, which involves only the system’s data, and then show that this exact bound agrees with the coderivative norm of the aforementioned mapping. In this way we extend to the convex setting the results of Cánovas et al. (SIAM J. Optim. 20, 1504–1526, 2009) developed for arbitrary perturbations with no block structure in the linear framework under the boundedness assumption on the system’s coefficients. The latter boundedness assumption is removed in this paper when the decision space is reflexive. The last section provides the aimed application to the convex case.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

On coderivatives and Lipschitzian properties of the dual pair in optimization

  • López Cerdá, Marco A.
  • Ridolfi, Andrea Beatriz
  • Vera de Serio, Virginia N.
In this paper, we apply the concept of coderivative and other tools from the generalized differentiation theory for set-valued mappings to study the stability of the feasible sets of both the primal and the dual problem in infinite-dimensional linear optimization with infinitely many explicit constraints and an additional conic constraint. After providing some specific duality results for our dual pair, we study the Lipschitz-like property of both mappings and also give bounds for the associated Lipschitz moduli. The situation for the dual shows much more involved than the case of the primal problem.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Subdifferential of the closed convex hull of a function and integration with nonconvex data in general normed spaces

  • López Cerdá, Marco A.
  • Volle, Michel
In this paper we approach the study of the subdifferential of the closed convex hull of a function and the related integration problem without the usual assumption of epi-pointedness. The key tool is, as in Hiriart-Urruty et al. (2011) [7], the concept of ε-subdifferential. Some other assumptions which are standard in the literature are also removed.
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.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

On the subdifferential of the supremum of an arbitrary family of extended real-valued functions

  • López Cerdá, Marco A.
  • Volle, Michel
In this paper, we derive a new formula for the subdifferential of the supremum of an arbitrary family of extended real-valued functions, in terms of the approximate subgradients of well chosen convex combinations of the data functions. The data functions are neither convex nor lower semicontinuous, but in this paper we assume that the supremum of the second conjugates of the data functions is proper and coincides with the second conjugate of the supremum function. Some applications of the main formula are provided. In particular, new formulas are given for the subdifferential of the closed convex hull of an extended real-valued function, as well as for the corresponding set of minimizers. We also get a generalization of the formula in Hiriart-Urruty et al. (J Funct Anal 118, 154–166 1993, Theorem 2.1) for the subdifferential of the sum. The paper finishes with the presentation of some open problems.