Skip to main content

AVANCES EN EL ESTUDIO VARIACIONAL DE PROBLEMAS DE OPTIMIZACION

MTM2014-59179-C2-2-P

•
Funding agency name Ministerio de Economía y Competitividad
Funding agency acronym MINECO
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2014
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Management unit Secretaría de Estado de Educación, Formación Profesional y Universidades
Beneficiary centre UNIVERSIDAD MIGUEL HERNANDEZ DE ELCHE

Resultados relacionados

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

RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

A Uniform Approach to Hölder Calmness of Subdifferentials

  • Beer, Gerald
  • Cánovas Cánovas, María Josefa
  • López Cerdá, Marco A.
  • Parra López, Juan
For finite-valued convex functions f defined on the n-dimensional Euclidean space, we are interested in the set-valued mapping assigning to each pair (f, x) the subdifferential of f at x. Our approach is uniform with respect to f in the sense that it involves pairs of functions close enough to each other, but not necessarily around a nominal function. More precisely, we provide lower and upper estimates, in terms of Hausdorff excesses, of the subdifferential of one of such functions at a nominal point in terms of the subdifferential of nearby functions in a ball centered in such a point. In particular, we obtain the (1/2) - Hölder calmness of our mapping at a nominal pair (f, x) under the assumption that the subdifferential mapping viewed as a set-valued mapping from Rn to Rn with f fixed is calm at each point of {x} X ∂f(x).
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Optimality Conditions in DC-Constrained Mathematical Programming Problems

  • Correa, Rafael
  • López Cerdá, Marco A.
  • Pérez-Aros, Pedro
This paper provides necessary and sufficient optimality conditions for abstract-constrained mathematical programming problems in locally convex spaces under new qualification conditions. Our approach exploits the geometrical properties of certain mappings, in particular their structure as difference of convex functions, and uses techniques of generalized differentiation (subdifferential and coderivative). It turns out that these tools can be used fruitfully out of the scope of Asplund spaces. Applications to infinite, stochastic and semi-definite programming are developed in separate sections.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Calmness of partially perturbed linear systems with an application to the central path

  • Cánovas Cánovas, María Josefa
  • Hall, Julian A.J.
  • López Cerdá, Marco A.
  • Parra López, Juan
In this paper we develop point-based formulas for the calmness modulus of the feasible set mapping in the context of linear inequality systems with a fixed abstract constraint and (partially) perturbed linear constraints. The case of totally perturbed linear systems was previously analyzed in [Cánovas MJ, López MA, Parra J, et al. Calmness of the feasible set mapping for linear inequality systems. Set-Valued Var Anal. 2014;22:375–389, Section 5]. We point out that the presence of such an abstract constraint yields the current paper to appeal to a notable different methodology with respect to previous works on the calmness modulus in linear programming. The interest of this model comes from the fact that partially perturbed systems naturally appear in many applications. As an illustration, the paper includes an example related to the classical central path construction. In this example we consider a certain feasible set mapping whose calmness modulus provides a measure of the convergence of the central path. Finally, we underline the fact that the expression for the calmness modulus obtained in this paper is (conceptually) implementable as far as it only involves the nominal data.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric

  • Beer, Gerald
  • Cánovas Cánovas, María Josefa
  • López Cerdá, Marco A.
  • Parra López, Juan
This paper analyzes the Lipschitz behavior of the feasible set mapping associated with linear and convex inequality systems in Rn. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified with the corresponding sets of coefficient vectors, which are assumed to be closed subsets of Rn+1. In this framework the size of perturbations is measured by means of the (extended) Hausdorff distance. A direct antecedent, extensively studied in the literature, comes from considering the parameter space of all linear systems with a fixed index set, T, where the Chebyshev (extended) distance is used to measure perturbations. In the present work we propose an appropriate indexation strategy which allows us to establish the equality of the Lipschitz moduli of the feasible set mappings in both parametric contexts, as well as to benefit from existing results in the Chebyshev setting for transferring them to the Hausdorff one. In a second stage, the possibility of perturbing directly the set of coefficient vectors of a linear system leads to new contributions on the Lipschitz behavior of convex systems via linearization techniques.