Related papers: A study of convex convex-composite functions via i…
In this work, we propose a convenient framework for infinite-dimensional analysis (including both real and complex analysis in infinite dimensions), in which differentiation (in some weak sense) and integration operations can be easily…
In a partially ordered semigroup with the duality (or polarity) transform, it is possible to define a generalisation of continued fractions. General sufficient conditions for convergence of continued fractions with deterministic terms are…
We study reduction schemes for functions of "many" variables into system of functions in one variable. Our setting includes infinite-dimensions. Following Cybenko-Kolmogorov, the outline for our results is as follows: We present explicit…
In this paper, we present a novel concept of the Fenchel conjugate for set-valued mappings and investigate its properties in finite and infinite dimensions. After establishing the fundamental properties of the Fenchel conjugate for…
We define convexity canonically in the setting of monoids. We show that many classical results from convex analysis hold for functions defined on such groups and semigroups, rather than only on vector spaces. Some examples and…
Valuations on the space of finite-valued convex functions on $\mathbb{C}^n$ that are continuous, dually epi-translation invariant, as well as $\mathrm{U}(n)$-invariant are completely classified. It is shown that the space of these…
In this paper, we provide conditions under which one can take derivatives of the solution to convex optimization problems with respect to problem data. These conditions are (roughly) that Slater's condition holds, the functions involved are…
We present an efficient algorithm for solving fractional programming problems whose objective functions are the ratio of a low-rank quadratic to a positive definite quadratic with convex constraints. The proposed algorithm for these…
We derive new prox-functions on the simplex from additive random utility models of discrete choice. They are convex conjugates of the corresponding surplus functions. In particular, we explicitly derive the convexity parameter of discrete…
It has been recently discovered that a convex function can be determined by its slopes and its infimum value, provided this latter is finite. The result was extended to nonconvex functions by replacing the infimum value by the set of all…
Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exist a convex…
In this paper, we study randomized and cyclic coordinate descent for convex unconstrained optimization problems. We improve the known convergence rates in some cases by using the numerical semidefinite programming performance estimation…
The decompositions of an element of a finite von Neumann algebra into the sum of a normal operator plus an s.o.t.-quasinilpotent operator, obtained using the Haagerup--Schultz hyperinvariant projections, behave well with respect to…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
A number of discrete and continuous optimization problems in machine learning are related to convex minimization problems under submodular constraints. In this paper, we deal with a submodular function with a directed graph structure, and…
This paper proposes a unique optimization approach for estimating the minimax rational approximation and its application for evaluating matrix functions. Our method enables the extension to generalized rational approximations and has the…
This paper is a detailed study of finite-dimensional modules defined on bicomplex numbers. A number of results are proved on bicomplex square matrices, linear operators, orthogonal bases, self-adjoint operators and Hilbert spaces, including…
In this work we deal with set-valued functions with values in the power set of a separated locally convex space where a nontrivial pointed convex cone induces a partial order relation. A set-valued function is evenly convex if its epigraph…
Detecting hidden convexity is one of the tools to address nonconvex minimization problems. After giving a formal definition of hidden convexity, we introduce the notion of conditional infimum, as it will prove instrumental in detecting…
In this paper, we investigate the concept of p-convexity for sets and functions in n-dimensional Euclidean space. We establish novel algebraic and topological results within this generalized convexity framework. Furthermore, we analyze…