Related papers: Nearly Convex Optimal Value Functions and Some Rel…
Local solutions for variational and quasi-variational inequalities are usually the best type of solutions that could practically be obtained when in case of lack of convexity or else when available numerical techniques are too limited for…
Operator convex functions defined on the positive half-line play a prominent role in the theory of quantum information, where they are used to define quantum $f$-divergences. Such functions admit integral representations in terms of…
In this paper, stability and sensitivity properties of a class of parametric constrained optimization problem, whose feasible region is defined by a set-valued inclusion, are investigated through the associated optimal value function.…
We define a class of discrete quasi convex functions, called semi-strictly quasi L$^{\natural}$-convex functions, and show that the steepest descent algorithm for L$^{\natural}$-convex function minimization also works for this class of…
We study the class of compact convex subsets of a topological vector space which admits a strictly convex and lower semicontinuous function. We prove that such a compact set is embeddable in a strictly convex dual Banach space endowed with…
In this paper, the class of (complex) quasi-Herglotz functions is introduced as the complex vector space generated by the convex cone of ordinary Herglotz functions. We prove characterization theorems, in particular, an analytic…
Proximal operators are now ubiquitous in non-smooth optimization. Since their introduction in the seminal work of Moreau, many papers have shown their effectiveness on a wide variety of problems, culminating in their use to construct…
In this paper we study the right differentiability of a parametric infimum function over a parametric set defined by equality constraints. We present a new theorem with sufficient conditions for the right differentiability with respect to…
Sufficient conditions are identified under which the value function and the optimal strategy of a Markov decision process (MDP) are even and quasi-convex in the state. The key idea behind these conditions is the following. First, sufficient…
This paper concerns the study of a broad class of minimal time functions corresponding to control problems with constant convex dynamics and closed target sets in arbitrary Banach spaces. In contrast to other publications, we do not impose…
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…
We introduce and investigate a new generalized convexity notion for functions called prox-convexity. The proximity operator of such a function is single-valued and firmly nonexpansive. We provide examples of (strongly) quasiconvex, weakly…
We present two approximate versions of the proximal subgradient method for minimizing the sum of two convex functions (not necessarily differentiable). The algorithms involve, at each iteration, inexact evaluations of the proximal operator…
The class of $\mu$-compact sets can be considered as a natural extension of the class of compact metrizable subsets of locally convex spaces, to which the particular results well known for compact sets can be generalized. This class…
In this note we explore duality in reverse convex optimization with reverse convex inequality constraints. While we are examining the special case of a finite index set of the inequality constraints, we are primarily interested in the…
In this paper, we investigate properties of set-valued mappings that establish connection between the values of this map at two arbitrary points of the domain and the value at their midpoint. Such properties are, for instance, Jensen…
Min-max problems have broad applications in machine learning, including learning with non-decomposable loss and learning with robustness to data distribution. Convex-concave min-max problem is an active topic of research with efficient…
We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…
The goal of this article is to present a survey of the recent theory of plurisubharmonic functions of quaternionic variables, and its applications to theory of valuations on convex sets and HKT-geometry (HyperK\"ahler with Torsion). The…
Many problems of theoretical and practical interest involve finding an optimum over a family of convex functions. For instance, finding the projection on the convex functions in $H^k(\Omega)$, and optimizing functionals arising from some…