Related papers: Dido's Problem and Beyond
In this paper we analyze theoretical properties of bi-objective convex-quadratic problems. We give a complete description of their Pareto set and prove the convexity of their Pareto front. We show that the Pareto set is a line segment when…
We discuss a general result of holomorphic extension of a real analytic function $f$ defined on the boundary $\partial D$ of a real analytic strictly convex subset $D\subset\subset \C^n$. We show that this follows from the hypothesis of…
This expository article is an introduction to Landau's problem of bounding the derivative, knowing bounds for the function and its second derivative, and some of its variants and generalizations. Connexions with convex and functional…
We develop the calculus of superforms as a tool for convex geometry. The formalism is applied to valuations on convex bodies, the Alexandrov-Fenchel inequalities and Monge- Amp\`ere equations on the boundary of convex bodies.
In this article we propose a generalization of the 2-dimensional notions of convexity resp. being star-shaped to symplectic vector spaces. We call such curves symplectically convex resp. symplectically star-shaped. After presenting some…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…
This paper describes the theory of Minkowski problems for geometric measures in convex geometric analysis. The theory goes back to Minkowski and Aleksandrov and has been developed extensively in recent years. The paper surveys classical and…
In this paper, we deal with an elliptic problem with the Dirichlet boundary condition. We operate in Sobolev spaces and the main analytic tool we use is the Lax-Milgram lemma. First, we present the variational approach of the problem which…
Optimization methods are at the core of many problems in signal/image processing, computer vision, and machine learning. For a long time, it has been recognized that looking at the dual of an optimization problem may drastically simplify…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
The subject of this thesis is in the area of Applied Mathematics known as Inverse Problems. Inverse problems are those where a set of measured data is analysed in order to get as much information as possible on a model which is assumed to…
It is well known that general variational inequalities provide us with a unified, natural, novel and simple framework to study a wide class of unrelated problems, which arise in pure and applied sciences. In this paper, we present a number…
There is a rich history of domino tilings in two dimensions. Through a variety of techniques we can answer questions such as: how many tilings are there of a given region or what does the space of all tilings look like? These questions and…
We prove some sharp extremal distance results for functions in weighted Bergman spaces on the upper halfplane.We also prove such results in the context of bounded strictly pseudoconvex domains with smooth boundary
A variational model for learning convolutional image atoms from corrupted and/or incomplete data is introduced and analyzed both in function space and numerically. Building on lifting and relaxation strategies, the proposed approach is…
In this paper extremal problems for uniform hypergraphs are studied in the general setting of hereditary properties. It turns out that extremal problems about edges are particular cases of a general analyic problem about a recently…
Differentiable structure ensures that many of the basics of classical convex analysis extend naturally from Euclidean space to Riemannian manifolds. Without such structure, however, extensions are more challenging. Nonetheless, in…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…