相关论文: Differential analysis of matrix convex functions

We propose a study of structured non-convex non-concave min-max problems which goes beyond standard first-order approaches. Inspired by the tight understanding established in recent works [Adil et al., 2022, Lin and Jordan, 2022b], we…

Our primary aim is to explore a sufficient condition for the class of meromorphically convex functions of order $\alpha$, where $0 \leq \alpha < 1$. The investigation will focus on studying a class of continuous functions defined on…

This article characterizes conjugates and subdifferentials of convex integral functionals over linear spaces of cadlag stochastic processes. The approach is based on new measurability results on the Skorokhod space and new interchange rules…

Level proximal subdifferential was introduced by Rockafellar recently for studying proximal mappings of possibly nonconvex functions. In this paper a systematic study of level proximal subdifferential is given. We characterize variational…

We study differentiable strongly quasiconvex functions for providing new properties for algorithmic and monotonicity purposes. Furthemore, we provide insights into the decreasing behaviour of strongly quasiconvex functions, applying this…

The focus of this article is on entropy and Markov processes. We study the properties of functionals which are invariant with respect to monotonic transformations and analyze two invariant "additivity" properties: (i) existence of a…

High dimensional covariance estimation and graphical models is a contemporary topic in statistics and machine learning having widespread applications. An important line of research in this regard is to shrink the extreme spectrum of the…

In decision-making, maxitive functions are used for worst-case and best-case evaluations. Maxitivity gives rise to a rich structure that is well-studied in the context of the pointwise order. In this article, we investigate maxitivity with…

In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…

The paper is devoted to the development of control procedures with a guide for conflict-controlled dynamical systems described by ordinary fractional differential equations with the Caputo derivative of an order $\alpha \in (0, 1).$ For the…

We prove a duality theorem the computation of certain Bellman functions is usually based on. As a byproduct, we obtain sharp results about the norms of monotonic rearrangements. The main novelty of our approach is a special class of…

In this article, we employ a standard convex argument to obtain new and refined inequalities related to the matrix mean of two accretive matrices, the numerical radius and the Tsallis relative operator entropy.

This paper presents a canonical d.c. (difference of canonical and convex functions) programming problem, which can be used to model general global optimization problems in complex systems. It shows that by using the canonical duality…

The computation of the Mittag-Leffler (ML) function with matrix arguments, and some applications in fractional calculus, are discussed. In general the evaluation of a scalar function in matrix arguments may require the computation of…

We introduce a polynomial time algorithm for optimizing the class of star-convex functions, under no restrictions except boundedness on a region about the origin, and Lebesgue measurability. The algorithm's performance is polynomial in the…

A natural consequence of the fractional calculus is its extension to a matrix order of differentiation and integration. A matrix-order derivative definition and a matrix-order integration arise from the generalization of the gamma function…

This manuscript introduces the idea of GS-exponential kind of convex functions and some of their algebraic features, and we introduce a new class GS-exponential kind of convex sets. In addition, we describe certain fundamental…

The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…

Preconditioning is a crucial operation in gradient-based numerical optimisation. It helps decrease the local condition number of a function by appropriately transforming its gradient. For a convex function, where the gradient can be…

We consider a class of nonconvex nonsmooth optimization problems whose objective is the sum of a smooth function and a finite number of nonnegative proper closed possibly nonsmooth functions (whose proximal mappings are easy to compute),…