Related papers: Coderivative characterizations of maximal monotoni…
Tilt stability is a fundamental concept of variational analysis and optimization that plays a pivotal role in both theoretical issues and numerical computations. This paper investigates tilt stability of local minimizers for a general class…
We establish a maximum principle for a two-point function in order to analyze the convexity of level sets of harmonic functions. We show that this can be used to prove a strict convexity result involving the smallest principal curvature of…
Over the last two decades, submodular function maximization has been the workhorse of many discrete optimization problems in machine learning applications. Traditionally, the study of submodular functions was based on binary function…
A basic idea in optimal transport is that optimizers can be characterized through a geometric property of their support sets called cyclical monotonicity. In recent years, similar "monotonicity principles" have found applications in other…
We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.
We give several new characterizations of completely monotone functions and Bernstein functions via two approaches: the first one is driven algebraically via elementary preserving mappings and the second one is developed in terms of the…
We study non-stationary stochastic processes arising from sequential dynamical systems built on maps with a neutral fixed points and prove the existence of Extreme Value Laws for such processes. We use an approach developed in \cite{FFV16},…
In this paper, we introduce several geometric characterizations for strong minima of optimization problems. Applying these results to nuclear norm minimization problems allows us to obtain new necessary and sufficient quantitative…
This paper conducts sensitivity analysis of random constraint and variational systems related to stochastic optimization and variational inequalities. We establish efficient conditions for well-posedness, in the sense of robust Lipschitzian…
In this paper, we perform sensitivity analysis for the maximal value function which is the optimal value function for a parametric maximization problem. Our aim is to study various subdifferentials for the maximal value function. We obtain…
The purpose of this paper is to characterize the concept of monotonicity according to a direction related to a set of n random variables in terms of its associated n-copula C. We start establishing relationships in the bivariate and…
Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…
This paper concerns the tilt stability of local optimal solutions to a class of nonlinear semidefinite programs, which involves a twice continuously differentiable objective function and a convex feasible set. By leveraging the second…
The large deviations properties of trajectory observables for chaotic non-invertible deterministic maps as studied recently by N. R. Smith, Phys. Rev. E 106, L042202 (2022) and by R. Gutierrez, A. Canella-Ortiz, C. Perez-Espigares,…
In this note we use recent results concerning the sum theorem for maximal monotone multifunctions in general Banach spaces to find new characterizations and properties of regular maximal monotone multifunctions and then use these to…
In this note we prove two extensions of a recent combinatorial characterization due to Li, Qiao, Wigderson, Wigderson and Zhang (arXiv:2206.04815) of the maximal dimension of bounded rank subspaces of the graphical matrix space associated…
We explore the possibility to derive basic calculus rules for some subdifferential constructions associated to set-valued maps between normed vector spaces. Then, we use these results in order to write optimality conditions for a special…
In the literature, necessary and sufficient conditions in terms of variational inequalities are introduced to characterize minimizers of convex set valued functions with values in a conlinear space. Similar results are proved for a weaker…
We solve a problem on a construction of a separately continuous mapping with the given diagonal, which is the pointwise limit of a sequence of continuous mappings valued in an equiconnected space. We construct an example of a closed-valued…
We consider the problem of computing the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints that admit quadratic relaxations. These non-convex constraints include semialgebraic sets and other…