Pasar al contenido principal

CONVEXIDAD Y CALCULO SUBDIFERENCIAL PARA PROBLEMAS DE OPTIMIZACION Y FACTIBILIDAD

PID2022-136399NB-C21

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2022
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE ALICANTE

Resultados relacionados

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

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

An extension of Bohr’s equivalence theorem to the case of exponential polynomials with distinct sets of frequencies

  • Sepulcre, Juan Matias
  • Vidal, Tomás
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
  • Vidal, Tomás|||/items/692fe094-5660-4e5e-bdfc-146a18c96d73
Inspired by Bohr’s equivalence relation concerning general Dirichlet series, in this paper we introduce a new equivalence relation on certain classes of exponential polynomials whose sets of frequencies are not necessarily equal. We first characterize this equivalence relation through a new perspective, and finally we obtain an improvement of Bohr’s equivalence theorem for the case of these finite exponential sums.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Measuring the Stability. A Paradigmatic Problem in Optimization

  • López Cerdá, Marco A.
This article aims to establish the fundamental notions on which stability analysis in optimization is based. It is a topic of singular importance in the analysis of any optimization problem, since the lack of stability can lead to serious problems in the application of the results. Our work here is of didactic nature and, consequently, it is limited to studying the basic criteria of qualitative and quantitative stability in Linear Programming. Formulas are provided that allow us to measure the level of each stability property by means of the so-called modulus. An important feature of our approach is that such moduli rely exclusively on the data of the nominal problem. The mathematical tools used in the paper are simple, consisting mainly in the analysis of lower/upper semicontinuity of set-valued mappings and, also, of their Lipschitz-type properties. Measuring the distance to ill-posed problems is another goal of this basic paper and some formulas to this purpose are shown. Most definitions are given for set-valued mappings between metric spaces, although the paper confines to Euclidean ones. The contents of the article could be incorporated into any introductory optimization course.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Conjugation-Based Approach to the ε-Subdifferential of Convex Suprema

  • Correa, Rafael
  • Hantoute, Abderrahim
  • López Cerdá, Marco A.
  • Hantoute, Abderrahim|||/items/257fa651-9a93-4e26-b88e-d90594995ecc
We provide new characterizations of the -subdifferential of the supremum of an arbitrary family of convex functions. The resulting formulas only involve approximate subdifferentials of adequate convex combinations of the data functions. Families of convex functions with a concavity-like property are introduced and their relationship with affine models is studied. The role of the lower semi-continuity of the data functions is also analyzed.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Integral-Type Representations for the Subdifferential of Suprema

  • Correa, Rafael
  • Hantoute, Abderrahim
  • Hantoute, Abderrahim|||/items/257fa651-9a93-4e26-b88e-d90594995ecc
An integral-like representation is provided for the ε-subdifferential of the supremum of an arbitrary family of convex functions. Our characterizations are expressed through appropriate discrete sums performed on the data functions ft ’s together with specific singular measures operating on them. Moreover, as long as the underlying space is a reflexive Banach space or a separable normed space, we substitute these additional measures with related limits that involve the data functions. All the objects involved in our characterizations rely intrinsically on the data functions that are (almost) active at the reference point.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Lagrange duality on DC evenly convex optimization problems via a generalized conjugation scheme

  • Fajardo, Maria Dolores
  • Vidal, José
  • Fajardo, Maria Dolores|||/items/f4594791-3589-4782-bb7a-5e213efccaf8
In this paper we study how Lagrange duality is connected to optimization problems whose objective function is the difference of two convex functions, briefly called DC problems. We present two Lagrange dual problems, each of them obtained via a different approach. While one of the duals corresponds to the standard formulation of the Lagrange dual problem, the other is written in terms of conjugate functions. When one of the involved functions in the objective is evenly convex, both problems are equivalent, but this relation is no longer true in the general setting. For this reason, we study conditions ensuring not only weak, but also zero duality gap and strong duality between the primal and one of the dual problems written using conjugate functions. For the other dual, and due to the fact that weak duality holds by construction, we just develop conditions for zero duality gap and strong duality between the primal DC problem and its (standard) Lagrange dual problem. Finally, we characterize weak and strong duality together with zero duality gap between the primal problem and its Fenchel-Lagrange dual following techniques used throughout the manuscript.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Conic relaxations for conic minimax convex polynomial programs with extensions and applications

  • Vicente-Pérez, José
  • Chuong, Thai Doan
  • Vicente-Pérez, José|||/items/7fad998a-2853-4a32-852d-d0c16df35750
In this paper, we analyze conic minimax convex polynomial optimization problems. Under a suitable regularity condition, an exact conic programming relaxation is established based on a positivity characterization of a max function over a conic convex system. Further, we consider a general conic minimax ρ-convex polynomial optimization problem, which is defined by appropriately extending the notion of conic convexity of a vector-valued mapping. For this problem, it is shown that a Karush-Kuhn-Tucker condition at a global minimizer is necessary and sufficient for ensuring an exact relaxation with attainment of the conic programming relaxation. The exact conic programming relaxations are applied to SOS-convex polynomial programs, where appropriate choices of the data allow the associated conic programming relaxation to be reformulated as a semidefinite programming problem. In this way, we can further elaborate the obtained results for other special settings including conic robust SOS-convex polynomial problems and difference of SOS-convex polynomial programs.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Regularity of Sets Under a Reformulation in a Product Space with Reduced Dimension

  • Campoy, Rubén
  • Campoy, Rubén|||/items/21264c6a-ecd6-4c42-bdfb-61ec73f47d5c
Different notions on regularity of sets and of collection of sets play an important role in the analysis of the convergence of projection algorithms in nonconvex scenarios. While some projection algorithms can be applied to feasibility problems defined by finitely many sets, some other require the use of a product space reformulation to construct equivalent problems with two sets. In this work we analyze how some regularity properties are preserved under a reformulation in a product space of reduced dimension. This allows us to establish local linear convergence of parallel projection methods which are constructed through this reformulation.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Forward-Backward Algorithms Devised by Graphs

  • Aragón Artacho, Francisco Javier
  • Campoy, Rubén
  • López-Pastor, César
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Campoy, Rubén|||/items/21264c6a-ecd6-4c42-bdfb-61ec73f47d5c
  • López-Pastor, César|||/items/aca48e4f-7c28-43c0-b414-ee1014bbf187
In this work, we present a methodology for devising forward-backward methods for finding zeros in the sum of a finite number of maximally monotone operators. We extend the framework and techniques from [SIAM J. Optim., 34 (2024), pp. 1569–1594] to cover the case involving a finite number of cocoercive operators, which should be directly evaluated instead of computing their resolvent. The algorithms are induced by three graphs that determine how the algorithm variables interact with each other and how they are combined to compute each resolvent. The hypotheses on these graphs ensure that the algorithms obtained have minimal lifting and are frugal, meaning that the ambient space of the underlying fixed-point operator has minimal dimension and that each resolvent and each cocoercive operator is evaluated only once per iteration. This framework not only allows us to recover some known methods, but also to generate new ones, such as the forward-backward algorithm induced by a complete graph. We conclude with a numerical experiment showing how the choice of graphs influences the performance of the algorithms.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Partially non-convex minimax theorem and applications to unique remoteness of sets and functions

  • Ghitri, M. I. A.
  • Hantoute, Abderrahim
  • Hantoute, Abderrahim|||/items/257fa651-9a93-4e26-b88e-d90594995ecc
We establish the following variant of the minimax inequality max y∈B inf x∈A f (y, x) ≥ inf x∈A sup y∈B0 f (y, x), where, unlike the classical minimax theorem, the functions f (y, ·) may not be convex for all y ∈ B but only for some of them (those in a possibly smaller set B0), while the function f is allowed to take infinite values. An application to the unique remoteness of sets and functions is given.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Optimality Conditions and Subdifferential Calculus for Infinite Sums of Functions

  • Hantoute, Abderrahim
  • Kruger, Alexander Y.
  • López Cerdá, Marco A.
The paper extends the widely used in optimisation theory decoupling techniques to infinite collections of functions. Extended concepts of uniform lower semicontinuity and firm uniform lower semicontinuity are discussed. The main theorems give fuzzy subdifferential necessary conditions (multiplier rules) for a local minimum of the sum of an infinite collection of functions and fuzzy subdifferential sum rules without the traditional Lipschitz continuity assumptions. More subtle “quasi” versions of the uniform infimum and uniform lower semicontinuity properties are also discussed.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Robust Generalized S-Procedure

  • Dinh, Nguyen
  • Goberna, Miguel A.
  • Long, Dang H.
  • Volle, Michel
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
We introduce in this paper the so-called robust generalized S-procedure associated with a given robust optimization problem. We provide a primal characterization for the validity of this procedure as well as a dual characterization under the assumption that the decision space is locally convex. We also analyze an extension of the mentioned robust S-procedure that incorporates a right-hand side function.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Randomized block proximal method with locally Lipschitz continuous gradient

  • Pérez-Aros, Pedro
  • Torregrosa-Belén, David
  • Torregrosa-Belén, David|||/items/31e6adbe-df7e-4c0e-b199-2a1098f83ec0
Block-coordinate algorithms are recognized to furnish efficient iterative schemes for addressing large-scale problems, especially when the computation of full derivatives entails substantial memory requirements and computational efforts. In this paper, we propose a randomized block proximal gradient algorithm for minimizing the sum of a smooth function and a separable proper lower semicontinuous function, both possibly nonconvex. In contrast to previous work, we only assume that the partial gradients of the smooth function are locally Lipschitz continuous with respect to their block of coordinates. At each iteration, the method adaptively selects a proximal stepsize to satisfy a sufficient decrease condition without requiring knowledge of the local Lipschitz moduli of the partial gradients of the smooth function. Hence, our work extends the applicability of randomized block-coordinate descent methods to more general problems where global Lipschitz gradient assumptions are not satisfied. In addition, our algorithm incorporates the possibility of conducting an additional boosted linesearch to enhance the performance of the algorithm. Our main result establishes subsequential convergence to a stationary point of the problem almost surely. Numerical experiments in nonnegative matrix factorization report that our method competes well with recognized algorithms. Furthermore, a symmetric variant of nonnegative matrix factorization illustrates the advantage of the boosted linesearch in problems where the proximal stepsize cannot be tightly estimated in accordance to the local Lipschitz modulus.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Primal and Dual Characterizations for Farkas Type Lemmas in Terms of Closedness Criteria

  • Dinh, Nguyen
  • Goberna, Miguel A.
  • Volle, Michel
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
This paper deals with the characterization, in terms of closedness of certain sets regarding other sets, of Farkas lemmas determining when the upperlevel set of a convex function f contains a set of the form C ∩ 𝔸 −1 (D), where C and D are convex sets (not necessarily cones) in locally convex spaces X (with topological dual X′) and Y, respectively, while 𝔸 is a continuous linear operator from X to Y. More in detail, each of the mentioned characterizations of Farkas type lemmas consists in the closedness of certain subset of either one of the “primal” spaces X × Y × ℝ and Y × ℝ, or of the “dual” space X′ × ℝ, regarding some singleton set of the corresponding space. Moreover, the paper also provides an existence theorem for the feasible set C ∩ 𝔸 −1 (D) in terms of the closedness of certain subset of the dual space X′ ×ℝ regarding the singleton set formed by the null element. These results are illustrated with significant applications to constrained convex minimization problems and to functional approximation by polynomials.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Log-exponential approximation in semi-infinite programming: A variational approach

  • Correa, Rafael
  • López Cerdá, Marco A.
  • Pérez-Aros, Pedro
In this paper, we propose an approximation technique for a function which is the supremum of a general family of functions by means of a function, of LogExp-type, involving a finite number of the data functions. A study of variational properties of such an approximating function is carried out in the paper. In particular, the epigraphic convergence of these approximating functions to the supremum function is proven. Moreover, refined calculus specifying the relations among the subdifferentials (regular and general) of the approximating and the data functions are provided in the first part of the paper. In the second part, we propose to approximate a general semi-infinite programming problem by a simple problem with a single constraint. Applying the results of the first part we establish, under standard hypotheses, the convergence of optimal values and solutions of these problems to the corresponding ones of the original problem. The Lagrangian duality of this problem is also studied but restricted to the semi-infinite convex programming problem, and optimal dual solutions are built by means of a sequential procedure.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Approaches to iterative algorithms for solving nonlinear equations with an application in tomographic absorption spectroscopy

  • Aragón Artacho, Francisco Javier
  • Cai, Weiwei
  • Censor, Yair
  • Gibali, Aviv
  • Shui, Chongyuan
  • Torregrosa-Belén, David
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Torregrosa-Belén, David|||/items/31e6adbe-df7e-4c0e-b199-2a1098f83ec0
In this paper we propose an approach for solving systems of nonlinear equations without computing function derivatives. Motivated by the application area of tomographic absorption spectroscopy, which is a highly-nonlinear problem with variables coupling, we consider a situation where straightforward translation to a fixed point problem is not possible because the operators that represent the relevant systems of nonlinear equations are not self-mappings, i.e., they operate between spaces of different dimensions. To overcome this difficulty we suggest an “alternating common fixed points algorithm” that acts alternatingly on the different vector variables. This approach translates the original problem to a common fixed point problem for which iterative algorithms are abound and exhibits a viable alternative to translation to an optimization problem, which usually requires derivatives information. However, to apply any of these iterative algorithms requires to ascertain the conditions that appear in their convergence theorems. To circumvent the need to verify conditions for convergence, we propose and motivate a derivative-free algorithm that better suits the tomographic absorption spectroscopy problem at hand and is even further improved by applying to it the superiorization approach. This is presented along with experimental results that demonstrate our approach.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A brief tutorial on semi-infinite optimization: the model, applications and basic mathematical constructions

  • López Cerdá, Marco A.
This article provides a brief review of the fundamentals of semi-infinite optimization and presents a selection of applications in various fields, as well as a short tutorial on the mathematical approach to optimality theory for linear/convex and general models. Alternative formulations of the KKT optimality conditions are established, emphasizing the relevance of the (local) Farkas–Minkowski property as a constraint qualification. Some personal reminiscences are included at the end of the article.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Robust generalized S-procedure revisited with applications to robust optimization problems

  • Dinh, Nguyen
  • Goberna, Miguel A.
  • Long, Dang H.
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
The classic S-procedure can be seen as an extension of the Farkas lemma from affine to quadratic functions characterizing when a concave quadratic function F is nonnegative on the solution set of a system of convex quadratic inequalities. This procedure can be extended in many directions. In this paper, the decision space X is infinite dimensional, and the function F is replaced by the supremum of a family of uncertain functions {Fu, u ∈ U} , where U is an uncertain set, and the corresponding robust S-procedure consists in the characterization of the nonnegativity of that supremum on X. The paper also studies a new type of procedure which is stable w.r.t. a class of convex functions. The new results are applied to obtain robust Farkas lemmas and to get optimality and duality theorems for robust optimization problems.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The Stability of Robustness for Conic Linear Programs with Uncertain Data

  • Goberna, Miguel A.
  • Jeyakumar, Vaithilingam
  • Li, Guoyin
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
The robust counterpart of a given conic linear program with uncertain data in the constraints is defined as the robust conic linear program that arises from replacing the nominal feasible set by the robust feasible set of points that remain feasible for any possible perturbation of the data within an uncertainty set. Any minor changes in the size of the uncertainty set can result in significant changes, for instance, in the robust feasible set, robust optimal value and the robust optimal set. The concept of quantifying the extent of these deviations is referred to as the stability of robustness. This paper establishes conditions for the stability of robustness under which minor changes in the size of the uncertainty sets lead to only minor changes in the robust feasible set of a given linear program with cone constraints and ball uncertainty sets.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Stepanov and Weyl Classes of c-Almost Periodic Type Functions

  • Ounis, Hadjer
  • Sepulcre, Juan Matias
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
As an extension of some classes of generalized almost periodic functions, in this paper we develop the notion of c-almost periodicity in the sense of Stepanov and Weyl approaches. In fact, we extend some basic results of this theory which were already demonstrated for the standard cases. In particular, we prove that every c-almost periodic function in the sense of Stepanov approach (in the sense of equi-Weyl or Weyl approaches, respectively) is also cm-almost periodic in the sense of Stepanov approach (in the sense of equi-Weyl or Weyl approaches, respectively) for each non-zero integer number m. This study is performed for both representative cases of functions defined on the real axis and with values in a Banach space and the complex functions defined on vertical strips in the complex plane.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Coderivative-based semi-Newton method in nonsmooth difference programming

  • Aragón Artacho, Francisco Javier
  • Mordukhovich, Boris S.
  • Pérez-Aros, Pedro
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
This paper addresses the study of a new class of nonsmooth optimization problems, where the objective is represented as a difference of two generally nonconvex functions. We propose and develop a novel Newton-type algorithm to solving such problems, which is based on the coderivative generated second-order subdifferential (generalized Hessian) and employs advanced tools of variational analysis. Well-posedness properties of the proposed algorithm are derived under fairly general requirements, while constructive convergence rates are established by using additional assumptions including the Kurdyka–Łojasiewicz condition. We provide applications of the main algorithm to solving a general class of nonsmooth nonconvex problems of structured optimization that encompasses, in particular, optimization problems with explicit constraints. Finally, applications and numerical experiments are given for solving practical problems that arise in biochemical models, supervised learning, constrained quadratic programming, etc., where advantages of our algorithms are demonstrated in comparison with some known techniques and results.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Analyzing lexicographical linear inequality systems via convex hulls

  • Vicente-Pérez, José
  • Vicente-Pérez, José|||/items/7fad998a-2853-4a32-852d-d0c16df35750
  • Rodríguez Álvarez, Margarita|||/items/81d9e7c1-c8aa-48b0-b6c7-5a4bd3e26327
Lexicographical extensions of well-known separation theorems for convex sets in are provided in the literature. Particularly, recent theorems regarding open and closed separation of a convex set from any outside point by linear operators from to , in the sense of the lexicographical order of , for each , allow to define two new families of properties for convex sets. Based on these results, that we review and extend in this paper, we provide dual characterizations for the consistency of two kinds of systems defined by weak and/or strict lexicographical linear inequalities, and for those inequalities which are satisfied for every solution of a given system. Such results are formulated in terms of appropriate convex hulls of certain sets depending on the coefficients of the system.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Normal cones to sublevel sets of suprema of convex and quasiconvex functions

  • Caro, Stephanie
  • Correa, Rafael
  • Hantoute, Abderrahim
  • Hantoute, Abderrahim|||/items/257fa651-9a93-4e26-b88e-d90594995ecc
We provide sharp and explicit characterizations of the normal cone to sublevel sets of suprema of arbitrary functions, expressed exclusively in terms of subdifferentials of the data functions. In the convex case, the resulting formulas involve the approximate and exact subdifferentials of the individual data functions at the nominal and nearby points. In contrast, the quasiconvex framework requires the use of the Fréchet subdifferential of these data functions but evaluated at nearby points. These results are applied to derive optimality conditions for infinite convex and quasiconvex optimization problems.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

On the strong Slater condition of linear systems with an evenly convex constraint set

  • Rodríguez Álvarez, Margarita
  • Vicente-Pérez, José
  • Rodríguez Álvarez, Margarita|||/items/81d9e7c1-c8aa-48b0-b6c7-5a4bd3e26327
  • Vicente-Pérez, José|||/items/7fad998a-2853-4a32-852d-d0c16df35750
This paper deals with the stability of the intersection of a given evenly convex set X with the solution set of a given linear system σ whose coefficients can be arbitrarily perturbed. More precisely, we focus on the set of strong Slater points of σ in X, by analyzing firstly the case when X is a closed convex set, and then the more general case when X is evenly convex. We shall establish dual characterizations for the aforementioned set of strong Slater points by following well-known characterizations of the solution set of a linear system. Finally, we apply our results to analyze the consistency of systems with both strict and weak inequalities defined by lower semicontinuous convex functions.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization

  • Aragón Artacho, Francisco Javier
  • Pérez-Aros, Pedro
  • Torregrosa-Belén, David
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Torregrosa-Belén, David|||/items/31e6adbe-df7e-4c0e-b199-2a1098f83ec0
In this paper we introduce the Boosted Double-proximal Subgradient Algorithm (BDSA), a novel splitting algorithm designed to address general structured nonsmooth and nonconvex mathematical programs expressed as sums and differences of composite functions. BDSA exploits the combined nature of subgradients from the data and proximal steps, and integrates a linesearch procedure to enhance its performance. While BDSA encompasses existing schemes proposed in the literature, it extends its applicability to more diverse problem domains. We establish the convergence of BDSA under the Kurdyka–Łojasiewicz property and provide an analysis of its convergence rate. To evaluate the effectiveness of BDSA, we introduce two novel test functions with an abundance of critical points. We conduct comparative evaluations, including algorithms with inertial terms, that illustrate its ability to effectively escape non-optimal critical points. Additionally, we present two practical applications of BDSA for testing its efficacy, namely, a constrained minimum-sum-of-squares clustering problem and a nonconvex generalization of Heron’s problem.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Quasipolynomial matrices connected with stable systems of difference-differential equations of neutral type

  • Dubon, Eric
  • Sepulcre, Juan Matias
  • Dubon, Eric|||/items/9cda69ba-e68d-440b-9d9b-4b143cc14228
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
This paper deals with stability problems for an important class of differential equations of neutral type and functional difference equations with constant delays, continuous time and matrix coefficients. Based on previous work of the second author, we give an adapted proof of a known point-wise characterization of the closure set of the real parts of the characteristic roots associated with such systems for the case where all delays vary independently of each other. We also provide explicit methods to construct quasipolynomial matrices whose characteristic roots coincide with the zeros of exponential polynomials with nonzero frequencies linearly independent over the rational numbers. As a main result, sufficient conditions for stability are derived from the spectral analysis of such classes of quasipolynomial matrices. These results are illustrated by means of several examples.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Convex regularization and subdifferential calculus

  • Correa, Rafael
  • Hantoute, Abderrahim
  • López Cerdá, Marco A.
  • Hantoute, Abderrahim|||/items/257fa651-9a93-4e26-b88e-d90594995ecc
This paper deals with the regularization of the sum of functions defined on a locally convex space through their closed-convex hulls in the bidual space. Different conditions guaranteeing that the closed-convex hull of the sum is the sum of the corresponding closed-convex hulls are provided. These conditions are expressed in terms of some ε-subdifferential calculus rules for the sum. The case of convex functions is also studied, and exact calculus rules are given under additional continuity/qualifications conditions. As an illustration, a variant of the proof of the classical Rockafellar theorem on convex integration is proposed.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Perturbational duality in optimization under evenly convex assumptions

  • Vicente-Pérez, José
  • Volle, Michel
  • Vicente-Pérez, José|||/items/7fad998a-2853-4a32-852d-d0c16df35750
In this paper, we consider an optimization problem which is embedded into a family of perturbed problems. We associate with it the classical conjugate dual problem and a surrogate dual problem called quasi-dual. For these two pairs of primal–dual problems, we provide necessary and sufficient conditions for zero duality gap, strong duality and converse duality, under evenly convex assumptions involving appropriate sets associated to the data perturbation function. To this aim, we firstly establish some new results for evenly convex and evenly quasiconvex functions. We conclude by applying our results to two remarkable instances of optimization problems.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

On the Regularization of the Supremum Function in the Bidual Space

  • Correa, Rafael
  • Hantoute, Abderrahim
  • López Cerdá, Marco A.
  • Hantoute, Abderrahim|||/items/257fa651-9a93-4e26-b88e-d90594995ecc
Conditions allowing the interchange between the supremum and biconjugation in the bidual space are provided. We establish alternative characterizations which involve both approximate and exact subdifferential calculus rules for the supremum. The so-called concave-like setting, which covers the particular case of finite families, gives rise to simpler criteria. We give an application to the regularization problem in convex optimization.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Perturbational Approach to Duality in Evenly Convex Set-Valued Optimization

  • Fajardo, Maria Dolores
  • Fajardo, Maria Dolores|||/items/f4594791-3589-4782-bb7a-5e213efccaf8
A general perturbation approach to conjugate duality theory in set-valued optimization considering set criterion, where the image space is a complete lattice whose elements are evenly convex sets, is presented. This image space structure is suitable for the conjugation scheme for set-valued functions which was defined in a previous work (Fajardo in Set-Valued Var. Anal. 30:827-846, 2022), and it allows to obtain a dual problem for a general primal one verifying weak dualty. Fenchel and Lagrange dual problems are presented as examples. We also obtain zero duality gap and strong duality theorems.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Strong Duality in Infinite Convex Optimization

  • Hantoute, Abderrahim
  • Kruger, Alexander Y.
  • López Cerdá, Marco A.
  • Hantoute, Abderrahim|||/items/257fa651-9a93-4e26-b88e-d90594995ecc
We develop a methodology for closing duality gap and guaranteeing strong duality in infinite convex optimization. Specifically, we examine two new Lagrangian-type dual formulations involving infinitely many dual variables and infinite sums of functions. Unlike the classical Haar duality scheme, these dual problems provide zero duality gap and are solvable under the standard Slater condition. We derive general optimality conditions/multiplier rules by applying subdifferential rules for infinite sums established in Hantoute, A J. Optim. Theory Appl. 2026, https://doi.org/10.1007/s10957-025-02916-w,
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Semi-c-periodicity, c-uniform recurrence and almost automorphy in the complex plane

  • Ounis, Hadjer
  • Sepulcre, Juan Matias
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
This paper is devoted to develop the concepts of semi-c-periodicity, c-uniform recurrence and almost automorphy for functions defined on vertical strips in the complex plane, where c is a non-zero complex number. As an extension of the study performed for functions defined on the real axis, this work aims to investigate the main properties of these classes of functions and establish their connections with the more known class of c-almost periodic functions defined on vertical strips. In fact, we resolve an open problem which was raised in 2020 for the real case. Additionally, we also use this approach to introduce an asymptotic version of these new classes of functions.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Graph splitting methods: fixed points and strong convergence for linear subspaces

  • Aragón Artacho, Francisco Javier
  • Bauschke, Heinz H.
  • Campoy, Rubén
  • López-Pastor, César
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Campoy, Rubén|||/items/21264c6a-ecd6-4c42-bdfb-61ec73f47d5c
  • López-Pastor, César|||/items/aca48e4f-7c28-43c0-b414-ee1014bbf187
In this paper, we develop a general analysis for the fixed points of the operators defining the graph splitting methods from [SIAM J. Optim. 2024;34:1569–1594] by Bredies, Chenchene and Naldi. We particularize it to the case where the maximally monotone operators are normal cones of closed linear subspaces and provide an explicit formula for the limit points of the graph splitting schemes. We exemplify these results on some particular algorithms, unifying in this way some results previously derived as well as obtaining new ones.
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Lagrange duality on DC evenly convex optimization problems via a generalized conjugation scheme

  • Fajardo Gómez, Maria Dolores
  • Vidal Núñez, José|||0000-0002-1190-6700
In this paper we study how Lagrange duality is connected to optimization problems whose objective function is the difference of two convex functions, briefly called DC problems. We present two Lagrange dual problems, each of them obtained via a different approach. While one of the duals corresponds to the standard formulation of the Lagrange dual problem, the other is written in terms of conjugate functions. When one of the involved functions in the objective is evenly convex, both problems are equivalent, but this relation is no longer true in the general setting. For this reason, we study conditions ensuring not only weak, but also zero duality gap and strong duality between the primal and one of the dual problems written using conjugate functions. For the other dual, and due to the fact that weak duality holds by construction, we just develop conditions for zero duality gap and strong duality between the primal DC problem and its (standard) Lagrange dual problem. Finally, we characterize weak and strong duality together with zero duality gap between the primal problem and its Fenchel-Lagrange dual following techniques used throughout the manuscript., Agencia Estatal de Investigación