Related papers: Optimal partition problems for the fractional lapl…
Set partitioning is a key component of many algorithms in machine learning, signal processing, and communications. In general, the problem of finding a partition that minimizes a given impurity (loss function) is NP-hard. As such, there…
The paper is devoted to the study of the unconditional extremal problem for a fractional linear integral functional defined on a set of probability distributions. In contrast to results proved earlier, the integrands of the integral…
We study the optimization version of the set partition problem (where the difference between the partition sums are minimized), which has numerous applications in decision theory literature. While the set partitioning problem is NP-hard and…
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…
We study a linear-quadratic optimal control problem involving a parabolic equation with fractional diffusion and Caputo fractional time derivative of orders $s \in (0,1)$ and $\gamma \in (0,1]$, respectively. The spatial fractional…
In this article we are interested in studying partitions of the square, the disk and the equilateral triangle which minimize a p-norm of eigenvalues of the Dirichlet-Laplace operator. The extremal case of the infinity norm, where we…
In this paper, we study a class of fractional optimal control problems. A necessary condition for the existence of an optimal control is provided in the literature. It is commonly given as the existence of a solution of a fractional…
We prove a lower bound on the first eigenvalue of the fractional Dirichlet-Laplacian of order $s$ on planar open sets, in terms of their inradius and topology. The result is optimal, in many respects. In particular, we recover a classical…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We prove that the planar hexagonal honeycomb is asymptotically optimal for a large class of optimal partition problems, in which the cells are assumed to be convex, and the criterion is to minimize either the sum or the maximum among the…
This paper studies chance-constrained stochastic optimization problems with finite support. It presents an iterative method that solves reduced-size chance-constrained models obtained by partitioning the scenario set. Each reduced problem…
We consider the problem of partitioning $n$ integers into two subsets of given cardinalities such that the discrepancy, the absolute value of the difference of their sums, is minimized. The integers are i.i.d. random variables chosen…
We study dynamic minimization problems of the calculus of variations with Lagrangian functionals containing Riemann-Liouville fractional integrals, classical and Caputo fractional derivatives. Under assumptions of regularity, coercivity and…
This survey synthesizes the current state of the art on the regularity theory for solutions to the optimal partition problem. Namely, we consider non-negative, vector-valued Sobolev functions whose components have mutually disjoint support,…
Partition problems in graphs are extremely important in applications, as shown in the Data science and Machine learning literature. One approach is spectral partitioning based on a Fiedler vector, i.e., an eigenvector corresponding to the…
In this paper, we first prove the existence of solutions to Dirichlet problems involving the fractional $g$-Laplacian operator and lower order terms by appealing to sub- and supersolution methods. Moreover, we also state the existence of…
We adopt the integral definition of the fractional Laplace operator and analyze an optimal control problem for a fractional semilinear elliptic partial differential equation (PDE); control constraints are also considered. We establish the…
We investigate time-dependent optimization problems in fractional Sobolev spaces with the sparsity promoting $L^p$-pseudo norm for $0<p<1$ in the objective functional. In order to avoid computing the fractional Laplacian on the time-space…
We consider the Max-Cut problem. Let $G = (V,E)$ be a graph with adjacency matrix $(a_{ij})_{i,j=1}^{n}$. Burer, Monteiro & Zhang proposed to find, for $n$ angles $\left\{\theta_1, \theta_2, \dots, \theta_n\right\} \subset [0, 2\pi]$,…
In this paper we study optimal control problems with either fractional or regional fractional $p$-Laplace equation, of order $s$ and $p\in [2,\infty)$, as constraints over a bounded open set with Lipschitz continuous boundary. The control,…