Related papers: Basic Polyhedral Theory
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…
This is an extended version of a talk on October 4, 2004 at the research seminar ``Differential geometry and applications'' (headed by Academician A. T. Fomenko) at Moscow State University. The paper contains an overview of available (but…
Seminal work by Edmonds and Lovasz shows the strong connection between submodularity and convexity. Submodular functions have tight modular lower bounds, and subdifferentials in a manner akin to convex functions. They also admit poly-time…
This is a write up on some sections of convex geometry, functional analysis, optimization, and nonstandard models that attract the author.
An overview of some of the recent developments in the theory of valuations on convex sets and its generalizations to manifolds is given. The exposition is focused towards applications to integral geometry; several of such applications are…
These lecture notes are intended as an introduction to the theory of rational Dunkl operators and the associated special functions, with an emphasis on positivity and asymptotics. We start with an outline of the general concepts: Dunkl…
This work aims to introduce the framework of polynomial optimization theory to solve fractional polynomial problems (FPPs). Unlike other widely used optimization frameworks, the proposed one applies to a larger class of FPPs, not…
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we…
Analogues of the classical inequalities from the Brunn-Minkowski theory for rotation intertwining additive maps of convex bodies are developed. Analogues are also proved of inequalities from the dual Brunn-Minkowski theory for intertwining…
The subject of Chapter 1 is GKK $\tau$-matrices and related topics. Chapter 2 is devoted to boundedly invertible collections of matrices, with applications to operator norms and spline approximation. Various structured matrices (Toeplitz,…
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…
We define w-invex set, w-preinvex, w-strictly preinvex, w-quasi preinvex, w-strictly quasi preinvex, w-semi-strictly quasi preinvex, and w-pre pseudo-invex functions in this context. And these form a class of real functions, which is the…
We survey several generalizations of the Weyl algebra including generalized Weyl algebras, twisted generalized Weyl algebras, quantized Weyl algebras, and Bell-Rogalski algebras. Attention is paid to ring-theoretic properties,…
We introduce and study the notion of plurisubharmonic functions in calibrated geometry. These functions generalize the classical plurisubharmonic functions from complex geometry and enjoy their important properties. Moreover, they exist in…
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…
Work of Hofer--Wysocki--Zehnder has shown that many spaces of pseudoholomorphic curves that arise when studying symplectic manifolds may be described as the zero set of a polyfold Fredholm section. This framework has many analytic…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
These notes constitute a sort of Crash Course in Optimal Transport Theory. The different features of the problem of Monge-Kantorovitch are treated, starting from convex duality issues. The main properties of space of probability measures…
Classical H.Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H.Minkowski uniqueness theorem due to A.D.Alexandrov are extended to a…
In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite…