Related papers: Numerical Approximation of Optimal Convex and Rota…
We associate a sequence of variational eigenvalues to any Radon measure on a compact Riemannian manifold. For particular choices of measures, we recover the Laplace, Steklov and other classical eigenvalue problems. In the first part of the…
This paper is concerned with finite element error estimates for Neumann boundary control problems posed on convex and polyhedral domains. Different discretization concepts are considered and for each optimal discretization error estimates…
In this paper we prove the existence of an optimal domain which minimizes the buckling load of a clamped plate among all bounded domains with given measure. Instead of treating this variational problem with a volume constraint, we introduce…
Optimal packing of objects in containers is a critical problem in various real-life and industrial applications. This paper investigates the two-dimensional packing of convex polygons without rotations, where only translations are allowed.…
Quaternion optimization has attracted significant interest due to its broad applications, including color face recognition, video compression, and signal processing. Despite the growing literature on quadratic and matrix quaternion…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…
We derive novel algorithms for optimization problems constrained by partial differential equations describing multiscale particle dynamics, including non-local integral terms representing interactions between particles. In particular, we…
A new approach to solving eigenvalue optimization problems for large structured matrices is proposed and studied. The class of optimization problems considered is related to computing structured pseudospectra and their extremal points, and…
We prove a sharp upper bound on convex domains, in terms of the diameter alone, of the best constant in a class of weighted Poincar\'e inequalities. The key point is the study of an optimal weighted Wirtinger inequality.
The optimal circle coverage problem aims to find a configuration of circles that maximizes the covered area within a given region. Although theoretical optimal solutions exist for simple cases, the problem's NP-hard characteristic makes the…
We present some new problems in spectral optimization. The first one consists in determining the best domain for the Dirichlet energy (or for the first eigenvalue) of the {\it metric Laplacian}, and we consider in particular Riemannian or…
When a convex perfectly conducting inclusion is closely spaced to the boundary of the matrix domain, a bigger convex domain containing the inclusion, the electric field can be arbitrary large. We establish both the pointwise upper bound and…
In this paper we deal with spectral optimization for the Robin Laplacian on a family of planar domains admitting parallel coordinates, namely a fixed-width strip built over a smooth closed curve and the exterior of a convex set with a…
In this paper, we consider the problem of minimizing a difference-of-convex objective over a nonlinear conic constraint, where the cone is closed, convex, pointed and has a nonempty interior. We assume that the support function of a compact…
In this survey paper we present a class of shape optimization problems where the cost function involves the solution of a PDE of elliptic type in the unknown domain. In particular, we consider cost functions which depend on the spectrum of…
Non-convex optimization problems have multiple local optimal solutions. Non-convex optimization problems are commonly found in numerous applications. One of the methods recently proposed to efficiently explore multiple local optimal…
In this paper, we study a constrained utility maximization problem following the convex duality approach. After formulating the primal and dual problems, we construct the necessary and sufficient conditions for both the primal and dual…
We present a method for finding lower bounds on the global infima of integral variational problems, wherein $\int_\Omega f(x,u(x),\nabla u(x)){\rm d}x$ is minimized over functions $u\colon\Omega\subset\mathbb{R}^n\to\mathbb{R}^m$ satisfying…
This paper is devoted to a new modification of a recently proposed adaptive stochastic mirror descent algorithm for constrained convex optimization problems in the case of several convex functional constraints. Algorithms, standard and its…