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): 11
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.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Differentiability v.s. convexity for complementarity functions

  • Huang, Chien-Hao
  • Chen, Jein-Shan
  • Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
It is known that complementarity functions play an important role in dealing with complementarity problems. The most well known complementarity problem is the symmetric cone complementarity problem (SCCP) which includes nonlinear complementarity problem (NCP), semidefinite complementarity problem (SDCP), and second-order cone complementarity problem (SOCCP) as special cases. Moreover, there is also so-called generalized complementarity problem (GCP) in infinite dimensional space. Among the existing NCP-functions, it was observed that there are no differentiable and convex NCP-functions. In particular, Miri and Effati (J Optim Theory Appl 164:723-730, 2015) show that convexity and differentiability cannot hold simultaneously for an NCP-function. In this paper, we further establish that such result also holds for general complementarity functions associated with the GCP.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

A generalization of the strong Fitzpatrick inequality

  • Elias, Leonardo M.
  • Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
We present a generalization of the strong Fitzpatrick inequality in the context of reflexive Banach spaces, involving a twisted bigger conjugate function. We also introduce a related family of gap functions for maximal monotone inclusion problems.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

A general nonconvex multiduality principle

  • Bonenti, Francesca
  • Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
  • Riccardi, Rossana
We introduce a (possibly infinite) collection of mutually dual nonconvex optimization problems, which share a common optimal value, and give a characterization of their global optimal solutions. As immediate consequences of our general multiduality principle, we obtain Toland-Singer duality theorem as well as an analogous result involving generalized perspective functions. Based on our duality theory, we propose an extension of an existing algorithm for the minimization of d.c. functions, which exploits Toland-Singer duality, to a more general class of nonconvex optimization problems.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

On Bregman-type distances for convex functions and maximally monotone operators

  • Burachik, Regina|||0000-0003-1332-6213
  • Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
Given two point to set operators, one of which is maximally monotone, we introduce a new distance in their graphs. This new concept reduces to the classical Bregman distance when both operators are the gradient of a convex function. We study the properties of this new distance and establish its continuity properties. We derive its formula for some particular cases, including the case in which both operators are linear monotone and continuous. We also characterize all bi-functions D for which there exists a convex function h such that D is the Bregman distance induced by h.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

A quasiconvex asymptotic function with applications in optimization

  • Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
  • Hadjisavvas, Nicolas
  • Lara, Felipe
We introduce a new asymptotic function, which is mainly adapted to quasiconvex functions. We establish several properties and calculus rules for this concept and compare it to previous notions of generalized asymptotic functions. Finally, we apply our new definition to quasiconvex optimization problems: we characterize the boundedness of the function, and the nonemptiness and compactness of the set of minimizers. We also provide a sufficient condition for the closedness of the image of a nonempty closed and convex set via a vector-valued function.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

A subdifferential characterization of Motzkin decomposable functions

  • Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
  • Thibault, L.|||0000-0002-4172-1301
The paper provides a new subdifferential characterization for Motzkin decomposable (convex) functions. This characterization leads to diverse stability properties for such a decomposability for operations like addition and composition.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Optimality conditions for convex problems on intersections of non necessarily convex sets

  • Allevi, Elisabetta|||0000-0003-4914-9124
  • Riccardi, Rossana
  • Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
We present necessary and sufficient optimality conditions for the minimization of pseudoconvex functions over convex intersections of non necessarily convex sets. To this aim, we use the notion of local normal cone to a closed set at a point, due to Linh and Penot (SIAM J Optim 17:500-510, 2006). The technique we use to obtain the optimality conditions is based on the so called canonical representation of a closed set by means of its associated oriented distance function.