# Optimization of Neumann Eigenvalues under convexity and geometric constraints

arXiv: https://arxiv.org/abs/2402.04117 · HTML: https://mlsanity.com/paper/2402.04117/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Feb 2024.

## Built on by (most cited first, 2 of 2)

- [Numerical exploration of the range of shape functionals using neural networks](https://mlsanity.com/paper/2602.14881/) (2026)
- [Parametrizing Convex Sets Using Sublinear Neural Networks](https://mlsanity.com/paper/2605.03520/) (2026)

## Abstract (arXiv)

In this paper we study optimization problems for Neumann eigenvalues μk among convex domains with a constraint on the diameter or the perimeter. We work mainly in the plane, though some results are stated in higher dimension. We study the existence of an optimal domain in all considered cases. We also consider the case of the unit disk, giving values of the index k for which it can be or cannot be extremal. We give some numerical examples for small values of k that lead us to state some conjectures.