Related papers: Optimal design problems in rough inhomogeneous med…
We consider the shape optimization problem which consists in placing a given mass $m$ of elastic material in a design region so that the compliance is minimal. Having in mind optimal light structures, our purpose is to show that the problem…
In this work, we construct a novel numerical method for solving the multi-marginal optimal transport problems with Coulomb cost. This type of optimal transport problems arises in quantum physics and plays an important role in understanding…
We consider the problem of solving a smooth convex optimization problem with equality and inequality constraints in a distributed fashion. Assuming that we have a group of agents available capable of communicating over a communication…
Quadratic constrained quadratic programming problems often occur in various fields such as engineering practice, management science, and network communication. This article mainly studies a non convex quadratic programming problem with…
Detecting hidden convexity is one of the tools to address nonconvex minimization problems. After giving a formal definition of hidden convexity, we introduce the notion of conditional infimum, as it will prove instrumental in detecting…
One revisits the standard saddle-point method based on conjugate duality for solving convex minimization problems. Our aim is to reduce or remove unnecessary topological restrictions on the constraint set. Dual equalities and…
This paper presents a methodology for solving a geometrically robust least squares problem, which arises in various applications where the model is subject to geometric constraints. The problem is formulated as a minimax optimization…
We prove that there exists a bounded convex domain $\Omega \subset \mathbf{R}^3$ of fixed volume that minimizes the first positive curl eigenvalue among all other bounded convex domains of the same volume. We show that this optimal domain…
We consider the problem of minimizing the relative perimeter under a volume constraint in an unbounded convex body $C\subset \mathbb{R}^{n+1}$, without assuming any further regularity on the boundary of $C$. Motivated by an example of an…
The paper deals with the Free Material Design (FMD) problem aimed at constructing the least compliant structures from an elastic material the constitutive field of which play the role of the design variable in the form of a tensor valued…
Many years ago John Tyrell a lecturer at King's college London challenged his Ph.D. students with the following puzzle: show that there is a unique triangle of minimal perimeter with exactly one vertex to lie on one of three given lines,…
In this paper we study the area minimizing problem in some kinds of conformal cones. This concept is a generalization of the cones in Eulcidean spaces and the cylinders in product manifolds. We define a non-closed-minimal (NCM) condition…
Polyhedral convex set optimization problems are the simplest optimization problems with set-valued objective function. Their role in set optimization is comparable to the role of linear programs in scalar optimization. Vector linear…
We consider optimization problems with manifold-valued constraints. These generalize classical equality and inequality constraints to a setting in which both the domain and the codomain of the constraint mapping are smooth manifolds. We…
This paper focuses on martingale optimal transport problems when the martingales are assumed to have bounded quadratic variation. First, we give a result that characterizes the existence of a probability measure satisfying some convex…
In this paper convex optimization techniques are employed for convex optimization problems in infinite dimensional Hilbert spaces. A first order optimality condition is given. Let $f : \mathbb{R}^{n}\rightarrow \mathbb{R}$ and let $x\in…
Convex algebraic geometry concerns the interplay between optimization theory and real algebraic geometry. Its objects of study include convex semialgebraic sets that arise in semidefinite programming and from sums of squares. This article…
We present a detailed set of performance comparisons of two state-of-the-art solvers for the application of designing time-delay compensators, an important problem in the field of robust control. Formulating such robust control mechanics as…
We consider the problem of geometric optimisation of the lowest eigenvalue of the Laplacian in the exterior of a compact planar set, subject to attractive Robin boundary conditions. Under either a constraint of fixed perimeter or area, we…
We address the optimal dynamic formation problem in mobile leader-follower networks where an optimal formation is generated to maximize a given objective function while continuously preserving connectivity. We show that in a convex mission…