Related papers: Variational Convexity of Functions and Variational…
The primary goal of the paper is to establish characteristic properties of (extended) real-valued functions defined on normed vector spaces that admit the representation as the lower envelope of their minimal (with respect to pointwise…
Variational analysis provides the theoretical foundations and practical tools for constructing optimization algorithms without being restricted to smooth or convex problems. We survey the central concepts in the context of a concrete but…
Motivated by a long-standing conjecture of Polya and Szeg\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the…
We introduce a compositional framework for convex analysis based on the notion of convex bifunction of Rockafellar. This framework is well-suited to graphical reasoning, and exhibits rich dualities such as the Legendre-Fenchel transform,…
We propose a new class of convex penalty functions, called \emph{variational Gram functions} (VGFs), that can promote pairwise relations, such as orthogonality, among a set of vectors in a vector space. These functions can serve as…
As established by R T. Rockafellar, real valued convex-concave functions are generically differentiable. It this paper we shall show that for a convex-concave function defined on an open convex set $C \times D,$ there exist dense subsets…
An important concept of convexificators has been extended to Hadamard manifolds in this paper. The mean value theorem for convexificators on the Hadamard manifold has also been derived. Monotonicity of the bounded convexificators has been…
We introduce new global and local inexact oracle concepts for a wide class of convex functions in composite convex minimization. Such inexact oracles naturally come from primal-dual framework, barrier smoothing, inexact computations of…
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…
Since introduced by Martinet and Rockafellar, the proximal point algorithm was generalized in many fruitful directions. More recently, in 2002, Pennanen studied the proximal point algorithm without monotonicity. A year later, Iusem and…
This paper addresses the study and applications of polyhedral duality of locally convex topological vector (LCTV) spaces. We first revisit the classical Rockafellar's proper separation theorem for two convex sets one which is polyhedral and…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
We examine the duality theory for a class of non-convex functions obtained by composing a convex function with a continuous one. Using Fenchel duality, we derive a dual problem that satisfies weak duality under general assumptions. To…
With the increasing interest in applying the methodology of difference-of-convex (dc) optimization to diverse problems in engineering and statistics, this paper establishes the dc property of many well-known functions not previously known…
The study of convex functions - in particular, of their optimization (really minimization) is one of the most important fields of applied mathematics. Convexity seems to be one of those incredibly well-chosen hypotheses which is just…
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 paper introduces a general strategy for identifying strong local minimizers of variational functionals. It is based on the idea that any variation of the integral functional can be evaluated directly in terms of the appropriate…
This paper investigates the preservation of local minimizers and strong minimizers of extended-real-valued lower semicontinuous functions under taking their Moreau envelopes. We address a general setting of Banach spaces, while all the…
We study the local and global versions of the convexity, which is closely related to the problem of extending a convex function on a non-convex domain to a convex function on the convex hull of the domain and beyond the convex hull. We also…
Computing explicitly the {\epsilon}-subdifferential of a proper function amounts to computing the level set of a convex function namely the conjugate minus a linear function. The resulting theoretical algorithm is applied to the the class…