Related papers: Existence theorems for optimal solutions in semi-a…
The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality…
In this paper, we introduce semi-infinite tensor complementarity problem to provide an approach for considering a more realistic situation of the problem. We prove the necessary and sufficient conditions for the existence of the solution…
We consider linear optimization over a fixed compact convex feasible region that is semi-algebraic (or, more generally, "tame"). Generically, we prove that the optimal solution is unique and lies on a unique manifold, around which the…
In recent years, semidefinite relaxations of common optimization problems in robotics have attracted growing attention due to their ability to provide globally optimal solutions. In many cases, it was shown that specific handcrafted…
This paper settles the existence question for a rather general class of convex optimal design problems with a volume constraint. In low dimensions, we prove the existence of an optimal configuration for general convex minimization problems…
In this paper, we consider a well-known sparse optimization problem that aims to find a sparse solution of a possibly noisy underdetermined system of linear equations. Mathematically, it can be modeled in a unified manner by minimizing…
Real continuous submodular functions, as a generalization of the corresponding discrete notion to the continuous domain, gained considerable attention recently. The analog notion for entropy functions requires additional properties: a real…
We present a general approach to prove existence of solutions for optimal control problems not based on typical convexity conditions which quite often are very hard, if not impossible, to check. By taking advantage of several relaxations of…
Let $S$ be an integral domain with field of fractions $F$ and let $A$ be an $F$-algebra having an $S$-stable basis. We prove the existence of an $S$-subalgebra $R$ of $A$ lying over $S$ whose localization with respect to $S$ is $A$ (we call…
We prove existence and uniqueness results for solutions to a class of optimal transportation problems with infinitely many marginals, supported on the real line. We also provide a characterization of the solution with an explicit formula.…
We first study Clarke's tangent cones at infinity to unbounded subsets of $\mathbb{R}^n.$ We prove that these cones are closed convex and show a characterization of their interiors. We then study subgradients at infinity for extended real…
In this paper we study the relationship between the optimal value of a homogeneous quadratic optimization problem and that of its Semidefinite Programming (SDP) relaxation. We consider two quadratic optimization models: (1) $\min \{x^* C x…
We present a branch-and-bound algorithm to improve the lower bounds obtained by SONC/SAGE. The running time is fixed-parameter tractable in the number of variables. Furthermore, we describe a new heuristic to obtain a candidate for the…
In this paper, "chance optimization" problems are introduced, where one aims at maximizing the probability of a set defined by polynomial inequalities. These problems are, in general, nonconvex and computationally hard. With the objective…
Let $T>0$ fixed. We consider the optimal control problem for analytic affine systems: $\ds{\dot{x}=f\_0(x)+\sum\_{i=1}^m u\_if\_i(x)}$, with a cost of the form: $\ds{C(u)=\int\_0^T \sum\_{i=1}^m u\_i^2(t)dt}$. For this kind of systems we…
We consider elliptic equations of Schr\"odinger type with a right-hand side fixed and with the linear part of order zero given by a potential V . The main goal is to study the optimization problem for an integral cost depending on the…
We provide theory for computing the lower semi-continuous convex envelope of functionals of the type f(x) plus an l2 misfit, and discuss applications to various non-convex optimization problems. The latter term is a data fit term whereas f…
This is a survey article on real algebra and geometry, and in particular on its recent applications in optimization and convexity. We first introduce basic notions and results from the classical theory. We then explain how these relate to…
We consider the semi-infinite optimization problem: $f^*:=\min_{x\in X}\:\{f(x): g(x,y)\,\leq \,0,\:\forally\in Y_x\}$, where $f,g$ are polynomials and $X\subset R^n$ as well as $Y_\x\subset R^p$, $x\in X$, are compact basic semi-algebraic…
In this work, we prove an existence result for an optimal partition problem of the form $$\min \{F_s(A_1,\dots,A_m)\colon A_i \in \mathcal{A}_s, \, A_i\cap A_j =\emptyset \mbox{ for } i\neq j\},$$ where $F_s$ is a cost functional with…