Related papers: Minimal Partitions for p-norms of Eigenvalues

We describe a new approximation algorithm for Max Cut. Our algorithm runs in $\tilde O(n^2)$ time, where $n$ is the number of vertices, and achieves an approximation ratio of $.531$. On instances in which an optimal solution cuts a…

This paper is concerned with eigenvalue problems for non-symmetric elliptic operators with large drifts in bounded domains under Dirichlet boundary conditions. We consider the minimal principal eigenvalue and the related principal…

We are concerned with the dependence of the lowest eigenvalue of the magnetic Dirichlet Laplacian on the geometry of rectangles, subject to homogeneous fields. We conjecture that the square is a global minimiser both under the area or…

We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.

In this paper, we mainly study eigenvalue problems of p-Laplacian on domains with an interior hole. Firstly we prove Faber-Krahn-type inequalities, and Cheng-type eigenvalue comparison theorems on manifolds. Secondly, we prove a comparison…

We prove existence of partitions of an open set $\Omega$ with a given number of phases, which minimize the sum of the fractional perimeters of all the phases, with Dirichlet boundary conditions. In two dimensions we show that, if the…

We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both problems are NP-hard. We write both problems as matrix-rank minimization and then relax them using the nuclear…

We consider the minimisation of Dirichlet eigenvalues $\lambda_k$, $k \in \N$, of the Laplacian on cuboids of unit measure in $\R^3$. We prove that any sequence of optimal cuboids in $\R^3$ converges to a cube of unit measure in the sense…

We consider a variational convex relaxation of a class of optimal partitioning and multiclass labeling problems, which has recently proven quite successful and can be seen as a continuous analogue of Linear Programming (LP) relaxation…

The problem of the minimization of least squares functionals with $\ell^1$ penalties is considered in an infinite dimensional Hilbert space setting. While there are several algorithms available in the finite dimensional setting there are…

In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…

Given a bounded domain $\Omega$ in $\mathbb{R}^N$, $N\geq 1$ we study the asymptotic behavior as $\varepsilon \to 0$ of the eigencurves of $$ -\Delta_p u_\varepsilon=\alpha_\varepsilon m(\tfrac{x}{\varepsilon})(u_\varepsilon^+ )^{p-1} -…

We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…

Discrete maximum principles in the approximation of partial differential equations are crucial for the preservation of qualitative properties of physical models. In this work we enforce the discrete maximum principle by performing a simple…

We present a finite difference method to compute the principal eigenvalue and the corresponding eigenfunction for a large class of second order elliptic operators including notably linear operators in nondivergence form and fully nonlinear…

This work develops an algorithm for PDE-constrained shape optimization based on Lipschitz transformations. Building on previous work in this field, the $p$-Laplace operator is utilized to approximate a descent method for Lipschitz shapes.…

We discuss computational and qualitative aspects of the fractional Plateau and the prescribed fractional mean curvature problems on bounded domains subject to exterior data being a subgraph. We recast these problems in terms of energy…

For primes $p$, we study the maximal possible size of a $p$-core $p'$-partition (a partition with no hook lengths or parts divisible by $p$). McDowell recently proved that the maximum is attained by a unique partition, say $\Lambda_p$.…

We derive sharp bounds for three types of eigenvalue problems. First, we derive an upper bound for the first $p$-Dirichlet eigenvalue on conformally compact (CC) spaces. As a consequence, we show that for a class of CC submanifolds of…

The problem of assessing the performance of algorithms used for the minimization of an $\ell_1$-penalized least-squares functional, for a range of penalty parameters, is investigated. A criterion that uses the idea of `approximation…