Related papers: Existence theorems for optimal solutions in semi-a…
In general, standard necessary optimality conditions cannot be formulated in a straightforward manner for semi-smooth shape optimization problems. In this paper, we consider shape optimization problems constrained by variational…
This paper is concerned at the minimization fundamental gap problem for a class of two-dimensional degenerate sub-elliptic operators. We establish existence results for weak solutions, Sobolev embedding theorem and spectral theory of…
We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular functions and monotone subadditive functions. Even though…
An unconstrained optimization problem is formulated in terms of tropical mathematics to minimize a functional that is defined on a vector set by a matrix and calculated through multiplicative conjugate transposition. For some particular…
In contrast to the many continuous global optimization methods that assume the objective function and constraints are factorable, we study how to find globally maximal solutions to problems that are not factorable, focusing on a particular…
In the general setting of a locally compact Abelian group $G$, the Delsarte extremal problem asks for the supremum of integrals over the collection of continuous positive definite functions $f: G \to \mathbb{R}$ satisfying $f(0) = 1$ and…
Minimization problems in $\ell^2$ for Tikhonov functionals with sparsity constraints are considered. Sparsity of the solution is ensured by a weighted $\ell^1$ penalty term. The necessary and sufficient condition for optimality is shown to…
Maximization of submodular functions under various constraints is a fundamental problem that has been studied extensively. A powerful technique that has emerged and has been shown to be extremely effective for such problems is the…
The main purpose of this paper is to investigate some natural problems regarding the order structure of representable functionals on $^*$-algebras. We describe the extreme points of order intervals, and give a nontrivial sufficient…
We describe a factor-revealing convex optimization problem for the integrality gap of the maximum-cut semidefinite programming relaxation: for each $n \geq 2$ we present a convex optimization problem whose optimal value is the largest…
In this paper, we study a shape optimization problem for the torsional energy associated with a domain contained in an infinite cylinder, under a volume constraint. We prove that a minimizer exists for all fixed volumes and show some of its…
We show how the numerical range of a matrix can be used to bound the optimal value of certain optimization problems over real tensor product vectors. Our bound is stronger than the trivial bounds based on eigenvalues, and can be computed…
If $\Omega$ is a bounded domain in $\mathbb R^N$ and $f$ a continuous increasing function satisfying a super linear growth condition at infinity, we study the existence and uniqueness of solutions for the problem (P): $\partial_tu-\Delta…
We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…
We consider the inverse optimization problem associated with the polynomial program f^*=\min \{f(x): x\in K\}$ and a given current feasible solution $y\in K$. We provide a systematic numerical scheme to compute an inverse optimal solution.…
There is a recent surge of interest in nonconvex reformulations via low-rank factorization for stochastic convex semidefinite optimization problem in the purpose of efficiency and scalability. Compared with the original convex formulations,…
We consider a multidimensional extremal problem formulated in terms of tropical mathematics. The problem is to minimize a nonlinear objective function, which is defined on a finite-dimensional semimodule over an idempotent semifield,…
We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…
We develop two adaptive discretization algorithms for convex semi-infinite optimization, which terminate after finitely many iterations at approximate solutions of arbitrary precision. In particular, they terminate at a feasible point of…
We study dynamic minimization problems of the calculus of variations with generalized Lagrangian functionals that depend on a general linear operator $K$ and defined on bounded-time intervals. Under assumptions of regularity, convexity and…