Related papers: Optimal design problems in rough inhomogeneous med…
In this paper we prove existence and uniqueness of viscosity solutions of elliptic systems associated to fully nonlinear operators for minimization problems that involve interconnected obstacles. This system appears, among other, in the…
Direct policy search has achieved great empirical success in reinforcement learning. Many recent studies have revisited its theoretical foundation for continuous control, which reveals elegant nonconvex geometry in various benchmark…
We are interested in the optimization of convex domains under a PDE constraint. Due to the difficulties of approximating convex domains in $\mathbb{R}^3$, the restriction to rotationally symmetric domains is used to reduce shape…
We introduce a family of hybrid discretisations for the numerical approximation of optimal control problems governed by the equations of immiscible displacement in porous media. The proposed schemes are based on mixed and discontinuous…
This paper investigates the optimality conditions for characterizing the local minimizers of the constrained optimization problems involving an $\ell_p$ norm ($0<p<1$) of the variables, which may appear in either the objective or the…
In this paper, we study a nonsmooth/nonconvex multiobjective optimization problem with uncertain constraints in arbitrary Asplund spaces. We first provide necessary optimality condition in a fuzzy form for approximate weakly robust…
In this paper we are interested in "optimal" universal geometric inequalities involving the area, diameter and inradius of convex bodies. The term "optimal" is to be understood in the following sense: we tackle the issue of…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…
We consider Newton's problem of minimal resistance, in particular we address the problem arising in the limit if the height goes to infinity. We establish existence of solutions and lack radial symmetry of solutions. Moreover, we show that…
Lossless Convexification (LCvx) is a modeling approach that transforms a class of nonconvex optimal control problems, where nonconvexity primarily arises from control constraints, into convex problems through convex relaxations. These…
Given an infeasible, unbounded, or pathological convex optimization problem, a natural question to ask is: what is the smallest change we can make to the problem's parameters such that the problem becomes solvable? In this paper, we address…
We consider the optimal control problem associated with a general version of the well known shallow lake model, and we prove the existence of an optimum in the class $L_{loc}^{1}\left(0,+\infty\right)$. Any direct proof seems to be missing…
We study the problem of minimizing the second Dirichlet eigenvalue for the Laplacian operator among sets of given perimeter. In two dimensions, we prove that the optimum exists, is convex, regular, and its boundary contains exactly two…
We propose an algorithm that produces a non-decreasing sequence of subsolutions for a class of optimal control problems distinguished by the property that the associated Bellman operators preserve convexity. In addition to a theoretical…
In this paper we study optimization problems for Neumann eigenvalues $\mu_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…
This paper presents a canonical dual approach to the problem of minimizing the sum of a quadratic function and the ratio of nonconvex function and quadratic functions, which is a type of non-convex optimization problem subject to an…
In this manuscript, we consider a control system governed by a general ordinary differential equation on a Riemannian manifold, with its endpoints satisfying some inequalities and equalities, and its control constrained to a closed convex…
We prove that bounded solutions to an overdetermined fully nonlinear free boundary problem in the plane are one dimensional. Our proof relies on maximum principle techniques and convexity arguments.
We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer programming model is available, and we illustrate this with…
In this paper, we investigate optimal (partial) transport problems for which the target is a non-convex polygonal domain in \(\mathbb{R}^2\). For the complete optimal transport problem, we prove that the singular set is locally a smooth…