Related papers: Polynomial valuations on convex functions and thei…
Let $T$ be a polynomially bounded o-minimal theory extending the theory of real closed ordered fields. Let $K$ be a model of $T$ equipped with a $T$-convex valuation ring and a $T$-derivation. If this derivation is continuous with respect…
We study a specific convex maximization problem in the space of continuous functions defined on a semi-infinite interval. An unexplained connection to the discrete version of this problem is investigated.
We consider the problem of maximizing a convex function over a closed convex set in a real Hilbert space. For linear functions, we show that a single orthogonal projection suffices to obtain an approximate solution. For continuous convex…
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…
In this paper, we study extensions of valuations over algebraic field extensions without the use of the Axiom of Choice. We show a bijection between the extensions of a valuation and the maximal ideals of the relative integral closure of…
We prove that polynomial valuations on vector lattices correspond to orthosymmetric multilinear maps. As a consequence we obtain a concise proof of the equivalence of orthosymmetry and orthogonal additivity.
We present an algorithm to approximate the solutions to variational problems where set of admissible functions consists of convex functions. The main motivator behind this numerical method is estimating solutions to Adverse Selection…
Coverage functions are an important subclass of submodular functions, finding applications in machine learning, game theory, social networks, and facility location. We study the complexity of partial function extension to coverage…
There is a well known construction of weakly continuous valuations on convex compact polytopes in R^n. In this paper we investigate when a special case of this construction gives a valuation which extends by continuity in the Hausdorff…
The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
The problem is considered as to whether a monotone function defined on a subset P of a Euclidean space can be strictly monotonically extended to the whole space. It is proved that this is the case if and only if the function is {\em…
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
We give a characterization of smooth, rotation and dually epi-translation invariant valuations and use this result to obtain a new proof of the Hadwiger theorem on convex functions. We also give a description of the construction of the…
We survey large value problems, including the large value problem for Dirichlet polynomials, the restriction problem, and problems from computer science. We describe known techniques and open problems, drawing on perspectives from all three…
For all simple and finite extension of a valued field, we prove that its defect is the product of the effective degrees of the complete set of key polynomials associated. As a consequence, we obtain a local uniformization theorem for…
Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range,…
We study a class of projective transformations of spectraplexes associated with self-dual cones and, on this basis, propose a polynomial-time algorithm for convex feasibility problems with positive definite constraints. At each iteration of…
We consider a class of infinite-dimensional optimization problems in which a distributed vector-valued variable should pointwise almost everywhere take values from a given finite set $\mathcal{M}\subset\mathbb{R}^m$. Such hybrid…
In this paper we present a characterization for the defect of a simple algebraic extension of rank one valued fields using the key polynomials that define the valuation. As a particular example, this gives the classification of defect…