Pasar al contenido principal

CONTRIBUCIONES AL ANALISIS VARIACIONAL: FUNDAMENTOS, DUALIDAD, ROBUSTEZ Y ALGORITMOS

PGC2018-097960-B-C22

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Generación de Conocimiento y Fortalecimiento Científico y Tecnológico del Sistema de I+D+i
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D (Excelencia / Generación de Conocimiento)
Año convocatoria 2018
Plan Estatal 2017-2020 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): 45
Encontrada(s) 1 página(s)

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

On the real projections of zeros of analytic almost periodic functions

  • Sepulcre, Juan Matias
  • Vidal, Tomás
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
  • Vidal, Tomás|||/items/692fe094-5660-4e5e-bdfc-146a18c96d73
This paper deals with the sets of real projections of zeros of analytic almost periodic functions defined in a vertical strip. By using our equivalence relation introduced in the context of the complex functions which can be represented by a Dirichlet-like series, this work provides practical results in order to determine whether a real number belongs to the closure of such a set. Its main result shows that, in the case that the Fourier exponents of an analytic almost periodic function are linearly independent over the rational numbers, such a set has no isolated points.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The converse of Bohr's equivalence theorem with Fourier exponents linearly independent over the rational numbers

  • Righetti, Mattia
  • Sepulcre, Juan Matias
  • Vidal, Tomás
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
  • Vidal, Tomás|||/items/692fe094-5660-4e5e-bdfc-146a18c96d73
Given two arbitrary almost periodic functions with Fourier exponents which are linearly independent over the rational numbers, we prove that the existence of a common open vertical strip V, where both functions assume the same set of values on every open vertical substrip included in V, is a necessary and sufficient condition for both functions to have the same region of almost periodicity and to be ⁎-equivalent or Bohr-equivalent. This result represents the converse of Bohr's equivalence theorem for this particular case.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A note on primal-dual stability in infinite linear programming

  • Goberna, Miguel A.
  • López Cerdá, Marco A.
  • Ridolfi, Andrea Beatriz
  • Vera de Serio, Virginia N.
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
In this note we analyze the simultaneous preservation of the consistency (and of the inconsistency) of linear programming problems posed in infinite dimensional Banach spaces, and their corresponding dual problems, under sufficiently small perturbations of the data. We consider seven different scenarios associated with the different possibilities of perturbations of the data (the objective functional, the constraint functionals, and the right hand-side function), i.e., which of them are known, and remain fixed, and which ones can be perturbed because of their uncertainty. The obtained results allow us to give sufficient and necessary conditions for the coincidence of the optimal values of both problems and for the stability of the duality gap under the same type of perturbations. There appear substantial differences with the finite dimensional case due to the distinct topological properties of cones in finite and infinite dimensional Banach spaces.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Robust and continuous metric subregularity for linear inequality systems

  • Camacho, Jesús
  • Cánovas Cánovas, María Josefa
  • López Cerdá, Marco A.
  • Parra López, Juan
This paper introduces two new variational properties, robust and continuous metric subregularity, for finite linear inequality systems under data perturbations. The motivation of this study goes back to the seminal work by Dontchev, Lewis, and Rockafellar (2003) on the radius of metric regularity. In contrast to the metric regularity, the unstable continuity behavoir of the (always finite) metric subregularity modulus leads us to consider the aforementioned properties. After characterizing both of them, the radius of robust metric subregularity is computed and some insights on the radius of continuous metric subregularity are provided.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The Douglas–Rachford algorithm for convex and nonconvex feasibility problems

  • Aragón Artacho, Francisco Javier
  • Campoy, Rubén
  • Tam, Matthew K.
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Campoy, Rubén|||/items/21264c6a-ecd6-4c42-bdfb-61ec73f47d5c
The Douglas–Rachford algorithm is an optimization method that can be used for solving feasibility problems. To apply the method, it is necessary that the problem at hand is prescribed in terms of constraint sets having efficiently computable nearest points. Although the convergence of the algorithm is guaranteed in the convex setting, the scheme has demonstrated to be a successful heuristic for solving combinatorial problems of different type. In this self-contained tutorial, we develop the convergence theory of projection algorithms within the framework of fixed point iterations, explain how to devise useful feasibility problem formulations, and demonstrate the application of the Douglas–Rachford method to said formulations. The paradigm is then illustrated on two concrete problems: a generalization of the “eight queens puzzle” known as the “(m, n)-queens problem”, and the problem of constructing a probability distribution with prescribed moments.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The Vortex-like Behavior of the Riemann Zeta Function to the Right of the Critical Strip

  • Sepulcre, Juan Matias
  • Vidal, Tomás
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
  • Vidal, Tomás|||/items/692fe094-5660-4e5e-bdfc-146a18c96d73
Based on an equivalence relation that was established recently on exponential sums, in this paper we study the class of functions that are equivalent to the Riemann zeta function in the half-plane {s ∈ C : Res > 1}. In connection with this class of functions, we first determine the value of the maximum abscissa from which the images of any function in it cannot take a prefixed argument. The main result shows that each of these functions experiments a vortex-like behavior in the sense that the main argument of its images varies indefinitely near the vertical line Re s = 1. In particular, regarding the Riemann zeta function ζ(s), for every σ0 > 1 we can assure the existence of a relatively dense set of real numbers {tm}m≥1 such that the parametrized curve traced by the points (Re(ζ(σ+itm)), Im(ζ(σ+itm))), with σ ∈ (1, σ0), makes a prefixed finite number of turns around the origin.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

New applications of linear semi-infinite optimization theory in copositive optimization

  • Goberna, Miguel A.
  • Ridolfi, Andrea Beatriz
  • Vera de Serio, Virginia N.
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
This paper provides a review and update of the theory of linear semi-infinite optimization, followed by its direct application to derive existence theorems, results on the geometry of the feasible set, duality theorems, and optimality conditions for copositive optimization problems.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Sets of values of equivalent almost periodic functions

  • Sepulcre, Juan Matias
  • Vidal, Tomás
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
  • Vidal, Tomás|||/items/692fe094-5660-4e5e-bdfc-146a18c96d73
This paper presents a full generalization of Bohr’s equivalence theorem for the case of almost periodic functions, which improves a recent result that was uniquely formulated in the case of existence of an integral basis for the set of exponents of the associated Dirichlet series.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

On Holomorphic Mappings with Compact Type Range

  • Jiménez Vargas, Antonio
  • Ruiz-Casternado, David
  • Sepulcre, Juan Matias
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
Using Mujica’s linearization theorem, we extend to the holomorphic setting some classical characterizations of compact (weakly compact, Rosenthal, Asplund) linear operators between Banach spaces such as the Schauder, Gantmacher and Gantmacher–Nakamura theorems and the Davis–Figiel–Johnson–Pełczynski, Rosenthal and Asplund factorization theorems.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Distributed forward-backward methods for ring networks

  • Aragón Artacho, Francisco Javier
  • Malitsky, Yura
  • Tam, Matthew K.
  • 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 work, we propose and analyse forward-backward-type algorithms for finding a zero of the sum of finitely many monotone operators, which are not based on reduction to a two operator inclusion in the product space. Each iteration of the studied algorithms requires one resolvent evaluation per set-valued operator, one forward evaluation per cocoercive operator, and two forward evaluations per monotone operator. Unlike existing methods, the structure of the proposed algorithms are suitable for distributed, decentralised implementation in ring networks without needing global summation to enforce consensus between nodes.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Evenly convex sets, and evenly quasiconvex functions, revisited

  • Goberna, Miguel A.
  • 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
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
Since its appearance, even convexity has become a remarkable notion in convex analysis. In the fifties, W. Fenchel introduced the evenly convex sets as those sets solving linear systems containing strict inequalities. Later on, in the eighties, evenly quasiconvex functions were introduced as those whose sublevel sets are evenly convex. The significance of even convexity relies on the different areas where it enjoys applications, ranging from convex optimization to microeconomics. In this paper, we review some of the main properties of evenly convex sets and evenly quasiconvex functions, provide further characterizations of evenly convex sets, and present some new results for evenly quasiconvex functions.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Equivalent almost periodic functions in terms of the new property of almost equality

  • Sepulcre, Juan Matias
  • Vidal, Tomás
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
  • Vidal, Tomás|||/items/692fe094-5660-4e5e-bdfc-146a18c96d73
In this paper we introduce the notion of almost equality (or, more specifically, almost equality by translations) of complex functions of an unrestricted real variable in terms of the new concept of ϵ-translation number of a function with respect to other one, which is inspired by Bohr’s notion of ϵ-translation number associated with an almost periodic function. We develop the main properties of this new class of functions and obtain a characterization through a very important equivalence relation which we introduced in previous papers in the context of the almost periodicity.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A Direct Proof of Convergence of Davis–Yin Splitting Algorithm Allowing Larger Stepsizes

  • Aragón Artacho, Francisco Javier
  • 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
This note is devoted to the splitting algorithm proposed by Davis and Yin (Set-valued Var. Anal. 25(4), 829–858, 2017) for computing a zero of the sum of three maximally monotone operators, with one of them being cocoercive. We provide a direct proof that guarantees its convergence when the stepsizes are smaller than four times the cocoercivity constant, thus doubling the size of the interval established by Davis and Yin. As a by-product, the same conclusion applies to the forward-backward splitting algorithm. Further, we use the notion of “strengthening” of a set-valued operator to derive a new splitting algorithm for computing the resolvent of the sum. Last but not least, we provide some numerical experiments illustrating the importance of appropriately choosing the stepsize and relaxation parameters of the algorithms.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm

  • Aragón Artacho, Francisco Javier
  • Campoy, Rubén
  • Elser, Veit
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Campoy, Rubén|||/items/21264c6a-ecd6-4c42-bdfb-61ec73f47d5c
We study the behavior of the Douglas–Rachford algorithm on the graph vertex-coloring problem. Given a graph and a number of colors, the goal is to find a coloring of the vertices so that all adjacent vertex pairs have different colors. In spite of the combinatorial nature of this problem, the Douglas–Rachford algorithm was recently shown to be a successful heuristic for solving a wide variety of graph coloring instances, when the problem was cast as a feasibility problem on binary indicator variables. In this work we consider a different formulation, based on semidefinite programming. The much improved performance of the Douglas–Rachford algorithm, with this new approach, is demonstrated through various numerical experiments.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization

  • Goberna, Miguel A.
  • Ridolfi, Andrea Beatriz
  • Vera de Serio, Virginia N.
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
In this paper, we update the theory of deterministic linear semi-infinite programming, mainly with the dual characterizations of the constraint qualifications, which play a crucial role in optimality and duality. From this theory, we obtain new results on conic and two-stage stochastic linear optimization. Specifically, for conic linear optimization problems, we characterize the existence of feasible solutions and some geometric properties of the feasible set, and we also provide theorems on optimality and duality. Analogously, regarding stochastic optimization problems, we study the semi-infinite reformulation of a problem-based scenario reduction problem in two-stage stochastic linear programming, providing a sufficient condition for the existence of feasible solutions as well as optimality and duality theorems to its non-combinatorial part.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality

  • Dinh, Nguyen
  • Goberna, Miguel A.
  • López Cerdá, Marco A.
  • Volle, Michel
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
We associate with each convex optimization problem, posed on some locally convex space, with infinitely many constraints indexed by the set T, and a given non-empty family H of finite subsets of T, a suitable Lagrangian-Haar dual problem. We obtain necessary and sufficient conditions for H-reducibility, that is, equivalence to some subproblem obtained by replacing the whole index set T by some element of H. Special attention is addressed to linear optimization, infinite and semi-infinite, and to convex problems with a countable family of constraints. Results on zero H-duality gap and on H-(stable) strong duality are provided. Examples are given along the paper to illustrate the meaning of the results.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Relaxed Lagrangian duality in convex infinite optimization: Reverse strong duality and optimality

  • Dinh, Nguyen
  • Goberna, Miguel A.
  • López Cerdá, Marco A.
  • Volle, Michel
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
We associate with each convex optimization problem posed on some locally convex space with an infinite index set T, and a given non-empty family H formed by finite subsets of T, a suitable Lagrangian-Haar dual problem. We provide reverse H-strong duality theorems, H-Farkas type lemmas, and optimality theorems. Special attention is addressed to infinite and semi-infinite linear optimization problems.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Bochner-Type Property on Spaces of Generalized Almost Periodic Functions

  • Sepulcre, Juan Matias
  • Vidal, Tomás
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
  • Vidal, Tomás|||/items/692fe094-5660-4e5e-bdfc-146a18c96d73
Our paper is focused on spaces of generalized almost periodic functions which, as in classical Fourier analysis, are associated with a Fourier series with real frequencies. In fact, based on a pertinent equivalence relation defined on the spaces of almost periodic functions in Bohr, Stepanov, Weyl and Besicovitch’s sense, we refine the Bochner-type property by showing that the condition of almost periodicity of a function in any of these generalized spaces can be interpreted in the way that, with respect to the topology of each space, the closure of its set of translates coincides with its corresponding equivalence class.
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)

Selected Applications of Linear Semi-Infinite Systems Theory

  • Goberna, Miguel A.
  • Ridolfi, Andrea Beatriz
  • Vera de Serio, Virginia N.
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
In this paper we, firstly, review the main known results on systems of an arbitrary (possibly infinite) number of weak linear inequalities posed in the Euclidean space Rn (i.e., with n unknowns), and, secondly, show the potential power of this theoretical tool by developing in detail two significant applications, one to computational geometry: the Voronoi cells, and the other to mathematical analysis: approximate subdifferentials, recovering known results in both fields and proving new ones. In particular, this paper completes the existing theory of farthest Voronoi cells of infinite sets of sites by appealing to well-known results on linear semi-infinite systems.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The projections of the zeros of exponential polynomials with complex frequencies

  • Mas, Alejandro
  • Sepulcre, Juan Matias
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
  • Mas, Alejandro|||/items/63ed4275-075c-48fb-8e88-3defd53977d9
We study the global distribution of zeros of exponential polynomials with complex coefficients and frequencies. For any P(z) in some class of such polynomials, we show that the closure of the projection of P-1(0) on a certain line is a finite union of disjoint segments. We describe this set, in particular we discuss the case where it consists of one segment.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A note on spaces of almost periodic functions with values in Banach spaces

  • Sepulcre, Juan Matias
  • Vidal, Tomás
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
  • Vidal, Tomás|||/items/692fe094-5660-4e5e-bdfc-146a18c96d73
In this paper we consider an equivalence relation on the space AP(R, X) of almost periodic functions with values in a prefixed Banach space X. In this context, it is known that the normality or Bochner-type property, which characterizes these functions, is based on the relative compactness of the family of translates. Now, we prove that every equivalence class is sequentially compact and the family of translates of a function belonging to this subspace is dense in its own class, i.e. the condition of almost periodicity of a function f ∈ AP(R, X) yields that every sequence of translates of f has a subsequence that converges to a function equivalent to f. This extends previous work by the same authors on the case of numerical almost periodic functions.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

On Subdifferentials Via a Generalized Conjugation Scheme: An Application to DC Problems and Optimality Conditions

  • Fajardo, Maria Dolores
  • Vidal, José
  • Fajardo, Maria Dolores|||/items/f4594791-3589-4782-bb7a-5e213efccaf8
This paper studies properties of a subdifferential defined using a generalized conjugation scheme. We relate this subdifferential together with the domain of an appropriate conjugate function and the ε-directional derivative. In addition, we also present necessary conditions for ε-optimality and global optimality in optimization problems involving the difference of two convex functions. These conditions will be written via this generalized notion of subdifferential studied in the first sections of the paper.
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)

A class of functional equations associated with almost periodic functions

  • Sepulcre, Juan Matias
  • Vidal, Tomás
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
  • Vidal, Tomás|||/items/692fe094-5660-4e5e-bdfc-146a18c96d73
In this paper we will get a class of functional equations involving a countable set of terms, summed by the well known Bochner–Fejér summation procedure, which are closely associated with the set of almost periodic functions. We will show that the zeros of a prefixed almost periodic function determine analytic solutions of such a functional equation associated with it, and we will obtain other solutions which are analytic or meromorphic on a certain domain.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Duality for convex infinite optimization on linear spaces

  • Goberna, Miguel A.
  • Volle, Michel
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
This note establishes a limiting formula for the conic Lagrangian dual of a convex infinite optimization problem, correcting the classical version of Karney [Math. Programming 27 (1983) 75-82] for convex semi-infinite programs. A reformulation of the convex infinite optimization problem with a single constraint leads to a limiting formula for the corresponding Lagrangian dual, called sup-dual, and also for the primal problem in the case when strong Slater condition holds, which also entails strong sup-duality.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments

  • Goberna, Miguel A.
  • Jeyakumar, Vaithilingam
  • Li, Guoyin
  • Vicente-Pérez, José
  • Vicente-Pérez, José|||/items/7fad998a-2853-4a32-852d-d0c16df35750
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
The radius of robust feasibility provides a numerical value for the largest possible uncertainty set that guarantees feasibility of a robust counterpart of a mathematical program with uncertain constraints. The objective of this review of the state-of-the-art in this field is to present this useful tool of robust optimization to its potential users and to avoid undesirable overlapping of research works on the topic as those we have recently detected. In this paper we overview the existing literature on the radius of robust feasibility in continuous and mixed-integer linearly constrained programs, linearly constrained semi-infinite programs, convexly constrained programs, and conic linearly constrained programs. We also analyze the connection between the radius of robust feasibility and the distance to ill-posedness for different types of uncertain mathematical programs.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm

  • Aragón Artacho, Francisco Javier
  • Campoy, Rubén
  • Vuong, Phan T.
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Campoy, Rubén|||/items/21264c6a-ecd6-4c42-bdfb-61ec73f47d5c
The Difference of Convex functions Algorithm (DCA) is widely used for minimizing the difference of two convex functions. A recently proposed accelerated version, termed BDCA for Boosted DC Algorithm, incorporates a line search step to achieve a larger decrease of the objective value at each iteration. Thanks to this step, BDCA usually converges much faster than DCA in practice. The solutions found by DCA are guaranteed to be critical points of the problem, but these may not be local minima. Although BDCA tends to improve the objective value of the solutions it finds, these are frequently just critical points as well. In this paper we combine BDCA with a simple Derivative-Free Optimization (DFO) algorithm to force the d-stationarity (lack of descent direction) at the point obtained. The potential of this approach is illustrated through some computational experiments on a Minimum-Sum-of-Squares clustering problem. Our numerical results demonstrate that the new method provides better solutions while still remains faster than DCA in the majority of test cases.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting

  • Aragón Artacho, Francisco Javier
  • Boţ, Radu I.
  • 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 work, we study resolvent splitting algorithms for solving composite monotone inclusion problems. The objective of these general problems is finding a zero in the sum of maximally monotone operators composed with linear operators. Our main contribution is establishing the first primal-dual splitting algorithm for composite monotone inclusions with minimal lifting. Specifically, the proposed scheme reduces the dimension of the product space where the underlying fixed point operator is defined, in comparison to other algorithms, without requiring additional evaluations of the resolvent operators. We prove the convergence of this new algorithm and analyze its performance in a problem arising in image deblurring and denoising. This work also contributes to the theory of resolvent splitting algorithms by extending the minimal lifting theorem recently proved by Malitsky and Tam to schemes with resolvent parameters.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación 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.
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)

Cohen strongly p-summing holomorphic mappings on Banach spaces

  • Jiménez Vargas, Antonio
  • Saadi, Khalil
  • Sepulcre, Juan Matias
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
Let E and F be complex Banach spaces, U be an open subset of E and 1 ≤ p ≤∞. We introduce and study the notion of a Cohen strongly p-summing holomorphic mapping from U to F, a holomorphic version of a strongly p-summing linear operator. For such mappings, we establish both Pietsch Domination/Factorization Theorems and analyse their linearizations from G∞ (U) (the canonical predual of H∞ (U)) and their transpositions on H∞ (U). Concerning the space DH∞ p formed by such mappings and endowed with a natural norm dH∞p, we show that it is a regular Banach ideal of bounded holomorphic mappings generated by composition with the ideal of strongly p-summing linear operators. Moreover, we identify the space (DH∞ p (U, F∗), dH∞p) with the dual of the completion of tensor product space G∞(U) ⊗ F endowed with the Chevet–Saphar norm gp.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The Boosted DC Algorithm for Linearly Constrained DC Programming

  • Aragón Artacho, Francisco Javier
  • Campoy, Rubén
  • Vuong, Phan T.
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
  • Campoy, Rubén|||/items/21264c6a-ecd6-4c42-bdfb-61ec73f47d5c
The Boosted Difference of Convex functions Algorithm (BDCA) has been recently introduced to accelerate the performance of the classical Difference of Convex functions Algorithm (DCA). This acceleration is achieved thanks to an extrapolation step from the point computed by DCA via a line search procedure. In this work, we propose an extension of BDCA that can be applied to difference of convex functions programs with linear constraints, and prove that every cluster point of the sequence generated by this algorithm is a Karush–Kuhn–Tucker point of the problem if the feasible set has a Slater point. When the objective function is quadratic, we prove that any sequence generated by the algorithm is bounded and R-linearly (geometrically) convergent. Finally, we present some numerical experiments where we compare the performance of DCA and BDCA on some challenging problems: to test the copositivity of a given matrix, to solve one-norm and infinity-norm trust-region subproblems, and to solve piecewise quadratic problems with box constraints. Our numerical results demonstrate that this new extension of BDCA outperforms DCA.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions

  • Aragón Artacho, Francisco Javier
  • Vuong, Phan T.
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
The boosted difference of convex functions algorithm (BDCA) was recently proposed for minimizing smooth difference of convex (DC) functions. BDCA accelerates the convergence of the classical difference of convex functions algorithm (DCA) thanks to an additional line search step. The purpose of this paper is twofold. First, we show that this scheme can be generalized and successfully applied to certain types of nonsmooth DC functions, namely, those that can be expressed as the difference of a smooth function and a possibly nonsmooth one. Second, we show that there is complete freedom in the choice of the trial step size for the line search, which is something that can further improve its performance. We prove that any limit point of the BDCA iterative sequence is a critical point of the problem under consideration and that the corresponding objective value is monotonically decreasing and convergent. The global convergence and convergence rate of the iterations are obtained under the Kurdyka--Łojasiewicz property. Applications and numerical experiments for two problems in data science are presented, demonstrating that BDCA outperforms DCA. Specifically, for the minimum sum-of-squares clustering problem, BDCA was on average 16 times faster than DCA, and for the multidimensional scaling problem, BDCA was 3 times faster than DCA.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Duality for the Robust Sum of Functions

  • Dinh, Nguyen
  • Goberna, Miguel A.
  • Volle, Michel
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
In this paper we associate with an infinite family of real extended functions defined on a locally convex space a sum, called robust sum, which is always well-defined. We also associate with that family of functions a dual pair of problems formed by the unconstrained minimization of its robust sum and the so-called optimistic dual. For such a dual pair, we characterize weak duality, zero duality gap, and strong duality, and their corresponding stable versions, in terms of multifunctions associated with the given family of functions and a given approximation parameter ε ≥ 0 which is related to the ε-subdifferential of the robust sum of the family. We also consider the particular case when all functions of the family are convex, assumption allowing to characterize the duality properties in terms of closedness conditions.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Asymmetric free spaces and canonical asymmetrizations

  • Daniilidis, Aris
  • Sepulcre, Juan Matias
  • Venegas M., Francisco
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
A construction analogous to that of Godefroy–Kalton for metric spaces allows one to embed isometrically, in a canonical way, every quasi-metric space (X,d) in an asymmetric normed space Fa(X,d) (its quasi-metric free space, also called asymmetric free space or semi-Lipschitz free space). The quasi-metric free space satisfies a universal property (linearization of semi-Lipschitz functions). The (conic) dual of Fa(X,d) coincides with the non-linear asymmetric dual of (X,d), that is, the space SLip0(X,d) of semi-Lipschitz functions on (X,d), vanishing at a base point. In particular, for the case of a metric space (X,D), the above construction yields its usual free space. On the other hand, every metric space (X,D) naturally inherits a canonical asymmetrization coming from its free space F(X). This gives rise to a quasi-metric space (X,D+) and an asymmetric free space Fa(X,D+). The symmetrization of the latter is isomorphic to the original free space F(X). The results of this work are illustrated with explicit examples.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning

  • Aragón Artacho, Francisco Javier
  • Censor, Yair
  • Gibali, Aviv
  • 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 study the split minimization problem that consists of two constrained minimization problems in two separate spaces that are connected via a linear operator that maps one space into the other. To handle the data of such a problem we develop a superiorization approach that can reach a feasible point with reduced (not necessarily minimal) objective function values. The superiorization methodology is based on interlacing the iterative steps of two separate and independent iterative processes by perturbing the iterates of one process according to the steps dictated by the other process. We include in our developed method two novel elements. The first one is the permission to restart the perturbations in the superiorized algorithm which results in a significant acceleration and increases the computational efficiency. The second element is the ability to independently superiorize subvectors. This caters to the needs of real-world applications, as demonstrated here for a problem in intensity-modulated radiation therapy treatment planning.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Duality for Sets of Strong Slater Points

  • 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
The strong Slater condition plays a significant role in the stability analysis of linear semi-infinite inequality systems. This piece of work studies the set of strong Slater points, whose non-emptiness guarantees the fullfilment of the strong Slater condition. Given a linear inequality system, we firstly establish some basic properties of the set of strong Slater points. Then, we derive dual characterizations for this set in terms of the data of the system, following similar characterizations provided also for the set of Slater points and the solution set of the given system, which are based on the polarity operators for evenly convex and closed convex sets. Finally, we present two geometric interpretations and apply our results to analyze the strict inequality systems defined by lower semicontinuous convex functions.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A new geometrical perspective on Bohr-equivalence of exponential polynomials

  • Sepulcre, Juan Matias
  • Vidal, Tomás
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
  • Vidal, Tomás|||/items/692fe094-5660-4e5e-bdfc-146a18c96d73
Based on Bohr’s equivalence relation for general Dirichlet series, in this paper we connect the families of equivalent exponential polynomials with a geometrical point of view related to lines in crystal-like structures. In particular we characterize this equivalence relation, and give an alternative proof of Bochner’s property referring to these functions, through this new geometrical perspective.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

The class of c-almost periodic functions defined on vertical strips in the complex plane

  • Ounis, Hadjer
  • Sepulcre, Juan Matias
  • Sepulcre, Juan Matias|||/items/c5b0b605-2507-4e33-a1e7-a7db056ba209
In this paper, we develop the notion of c-almost periodicity for functions defined on vertical strips in the complex plane. As a generalization of Bohr’s concept of almost periodicity, we study the main properties of this class of functions which was recently introduced for the case of one real variable. In fact, we extend some important results of this theory which were already demonstrated for some particular cases. In particular, given a non-null complex number c, we prove that the family of vertical translates of a prefixed c-almost periodic function defined in a vertical strip U is relatively compact on any vertical substrip of U, which leads to proving that every c-almost periodic function is also almost periodic and, in fact, cm-almost periodic for each integer number m.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Duality for constrained robust sum optimization problems

  • Dinh, Nguyen
  • Goberna, Miguel A.
  • Long, Dang H.
  • Volle, Michel
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
Given an infinite family of extended real-valued functions fi, i∈I, and a family H of nonempty finite subsets of I, the H-partial robust sum of fi, i∈I, is the supremum, for J∈H, of the finite sums ∑j∈Jfj. These infinite sums arise in a natural way in location problems as well as in functional approximation problems, and include as particular cases the well-known sup function and the so-called robust sum function, corresponding to the set H of all nonempty finite subsets of I, whose unconstrained minimization was analyzed in previous papers of three of the authors (https://doi.org/10.1007/s11228-019-00515-2 and https://doi.org/10.1007/s00245-019-09596-9). In this paper, we provide ordinary and stable zero duality gap and strong duality theorems for the minimization of a given H-partial robust sum under constraints, as well as closedness and convex criteria for the formulas on the subdifferential of the sup-function.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite Programs

  • Goberna, Miguel A.
  • Jeyakumar, Vaithilingam
  • Li, Guoyin
  • Goberna, Miguel A.|||/items/0ddb5812-3544-4062-a814-e139c72d8c3e
The radius of robust feasibility provides a numerical value for the largest possible uncertainty set that guarantees robust feasibility of an uncertain linear conic program. This determines when the robust feasible set is non-empty. Otherwise, the robust counterpart of an uncertain program is not well defined as a robust optimization problem. In this paper, we address a key fundamental question of robust optimization: How to compute the radius of robust feasibility of uncertain linear conic programs, including linear programs? We first provide computable lower and upper bounds for the radius of robust feasibility for general uncertain linear conic programs under the commonly used ball uncertainty set. We then provide important classes of linear conic programs where the bounds are calculated by finding the optimal values of related semi-definite linear programs, among them uncertain semi-definite programs, uncertain second-order cone programs and uncertain support vector machine problems. In the case of an uncertain linear program, the exact formula allows us to calculate the radius by finding the optimal value of an associated second-order cone program.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Finding magic squares with Douglas—Rachford algorithm

  • Aragón Artacho, Francisco Javier
  • Segura Martínez, Paula
  • Aragón Artacho, Francisco Javier|||/items/1606bcd1-4dcb-4543-98d2-cba4400516f6
In this expository paper, we show how to use the Douglas—Rachford algorithm as a successful heuristic for finding magic squares. The Douglas—Rachford algorithm is an iterative projection method for solving feasibility problems. Although its convergence is only guaranteed in the convex setting, the algorithm has been successfully applied to a number of similar nonconvex problems, such as solving Sudoku puzzles. We present two formulations of the nonconvex feasibility problem of finding magic squares, which are inspired by those of Sudoku, and test the Douglas—Rachford algorithm on them.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Conic Relaxations with Stable Exactness Conditions for Parametric Robust Convex Polynomial Problems

  • Chuong, Thai Doan
  • Vicente-Pérez, José
  • Vicente-Pérez, José|||/items/7fad998a-2853-4a32-852d-d0c16df35750
In this paper, we examine stable exact relaxations for classes of parametric robust convex polynomial optimization problems under affinely parameterized data uncertainty in the constraints. We first show that a parametric robust convex polynomial problem with convex compact uncertainty sets enjoys stable exact conic relaxations under the validation of a characteristic cone constraint qualification. We then show that such stable exact conic relaxations become stable exact semidefinite programming relaxations for a parametric robust SOS-convex polynomial problem, where the uncertainty sets are assumed to be bounded spectrahedra. In addition, under the corresponding constraint qualification, we derive stable exact second-order cone programming relaxations for some classes of parametric robust convex quadratic programs under ellipsoidal uncertainty sets.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On farthest Voronoi cells

  • Goberna Torrent, Miguel Angel
  • Martínez Legaz, Juan Enrique|||0000-0002-6845-6202
  • Todorov, Maxim
Given an arbitrary set T in the Euclidean space Rn, whose elements are called sites, and a particular site s, the farthest Voronoi cell of s, denoted by FT(s), consists of all points which are farther from s than from any other site. In this paper we study farthest Voronoi cells and diagrams corresponding to arbitrary (possibly infinite) sets. More in particular, we characterize, for a given arbitrary set T, those s∈T such that FT(s) is nonempty and study the geometrical properties of FT(s) in that case. We also characterize those sets T whose farthest Voronoi diagrams are tesselations of the Euclidean space, and those sets that can be written as FT(s) for some T⊂Rn and some s∈T.