相关论文: Differential analysis of matrix convex functions

Higher-order tensor methods were recently proposed for minimizing smooth convex and nonconvex functions. Higher-order algorithms accelerate the convergence of the classical first-order methods thanks to the higher-order derivatives used in…

First-order methods are often analyzed via their continuous-time models, where their worst-case convergence properties are usually approached via Lyapunov functions. In this work, we provide a systematic and principled approach to find and…

In this paper we develop general formulas for the subdifferential of the pointwise supremum of convex functions, which cover and unify both the compact continuous and the non-compact non-continuous settings. From the non-continuous to the…

We view a conic optimization problem that has a unique solution as a map from its data to its solution. If sufficient regularity conditions hold at a solution point, namely that the implicit function theorem applies to the normalized…

This paper concerns matrix "convex" functions of (free) noncommuting variables, $x = (x_1, \ldots, x_g)$. Helton and McCullough showed that a polynomial in $x$ which is matrix convex is of degree two or less. We prove a more general result:…

The paper concerns the second-order generalized differentiation theory of variational analysis and new applications of this theory to some problems of constrained optimization in finitedimensional spaces. The main attention is paid to the…

We prove conditions for the existence of a continuous linear right inverse for a surjective convolution operator in spaces of germs of analytic functions on convex subsets of the complex plane. Considered convex sets have a countable…

Motivated by the direct method in the calculus of variations in $L^{\infty}$, our main result identifies the notion of convexity characterizing the weakly$^*$ lower semicontinuity of nonlocal supremal functionals: Cartesian level convexity.…

This paper studies the convexity properties of nonsmooth extended-real-valued weakly convex functions, a class of functions that is central to modern optimization and its applications. We establish new characterizations of convexity using…

We derive, by means of variational techniques, a limiting description for a class of integral functionals under linear differential constraints. The functionals are designed to encode the energy of a high-contrast composite, that is, a…

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…

We study containment and uniqueness problems concerning matrix convex sets. First, to what extent is a matrix convex set determined by its first level? Our results in this direction quantify the disparity between two product operations,…

We study variational regularisation methods for inverse problems with imperfect forward operators whose errors can be modelled by order intervals in a partial order of a Banach lattice. We carry out analysis with respect to existence and…

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…

Discrete convex functions are used in many areas, including operations research, discrete-event systems, game theory, and economics. The objective of this paper is to offer a survey on fundamental operations for various kinds of discrete…

As an application of Brouwer's fixed-point theorem we prove that a continuously differentiable convex function with gradient of constant norm is an affine mapping. It is a first-order characterization of affine mappings among continuously…

We explore the relationship between convex and subharmonic functions on discrete sets. Our principal concern is to determine the setting in which a convex function is necessarily subharmonic. We initially consider the primary notions of…

This paper provides versions of classical results from linear algebra, real analysis and convex analysis in a free module of finite rank over the ring $L^0$ of measurable functions on a $\sigma$-finite measure space. We study the question…

The recent results of An, Luan, and Yen [Differential stability in convex optimization via generalized polyhedrality. Vietnam J. Math. https://-doi.org/10.1007/s10013-024-00721-y] on differential stability of parametric optimization…

In [B1, Theorem 2.36] we proved the equivalence of six conditions on a continuous function f on an interval. These conditions define a subset of the set of operator convex functions, whose elements are called strongly operator convex. Two…