Pasar al contenido principal

AVANCES EN EL ESTUDIO VARIACIONAL DE PROBLEMAS DE OPTIMIZACION

MTM2014-59179-C2-2-P

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D (Excelencia / Generación de Conocimiento)
Año convocatoria 2014
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Unidad de gestión Secretaría de Estado de Educación, Formación Profesional y Universidades
Centro beneficiario UNIVERSIDAD MIGUEL HERNANDEZ DE ELCHE
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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
Publicación 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.