Related papers: Characterizations of symmetric polyconvexity
In this paper, we focus on the following general shape optimization problem: $$ \min\{J(\Om), \Om convex, \Om\in\mathcal S_{ad}\}, $$ where $\mathcal S_{ad}$ is a set of 2-dimensional admissible shapes and $J:\mathcal{S}_{ad}\to\R$ is a…
Nonconvex functionals with spherical symmetry are studied. Existence of one and radial symmetry of all global minimizers is shown with an approach based on convex relaxation.
We investigate exact semidefinite programming (SDP) relaxations for the problem of minimizing a nonconvex quadratic objective function over a feasible region defined by both finitely and infinitely many nonconvex quadratic inequality…
For general quadratically-constrained quadratic programming (QCQP), we propose a parabolic relaxation described with convex quadratic constraints. An interesting property of the parabolic relaxation is that the original non-convex feasible…
This presentation explains why models with a dynamical symmetry often work extraordinarily well even in the presence of large symmetry breaking interactions. A model may be a caricature of a more realistic system with a "quasi-dynamical"…
In this paper we prove that solutions to several shape optimization problems in the plane, with a convexity constraint on the admissible domains, are polygons. The main terms of the shape functionals we consider are either E f ($\Omega$),…
We give two examples where symmetric polynomials play an important role in physics: First, the partition functions of ideal quantum gases are closely related to certain symmetric polynomials, and a part of the corresponding theory has a…
This article gives estimates on covering numbers and diameters of random proportional sections and projections of symmetric quasi-convex bodies in $\mathbb R$. These results were known for the convex case and played an essential role in…
We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either…
In the present paper, the following convexity principle is proved: any closed convex multifunction, which is metrically regular in a certain uniform sense near a given point, carries small balls centered at that point to convex sets, even…
In this paper, we investigate the concept of p-convexity for sets and functions in n-dimensional Euclidean space. We establish novel algebraic and topological results within this generalized convexity framework. Furthermore, we analyze…
Motivated by applications in robotics and computer vision, we study problems related to spatial reasoning of a 3D environment using sublevel sets of polynomials. These include: tightly containing a cloud of points (e.g., representing an…
A class of three-dimensional models which satisfy supersymmetric intertwining relations with the simplest - oscillator-like - variant of shape invariance is constructed. It is proved that the models are not amenable to conventional…
This work provides a general overview for the treatment of symmetries in classical field theories and (pre)multisymplectic geometry. The geometric characteristics of the relation between how symmetries are interpreted in theoretical physics…
Quasisymmetry builds a third invariant for charged-particle motion besides energy and magnetic moment. We address quasisymmetry at the level of approximate symmetries of first-order guiding-centre motion. We find that the conditions to…
The paper considers the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation scenarios, and is a special case of an optimization of a…
In this work, we study the well-posedness of certain sparse regularized linear regression problems, i.e., the existence, uniqueness and continuity of the solution map with respect to the data. We focus on regularization functions that are…
Motivated by a long-standing conjecture of Polya and Szeg\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the…
We present two characterizations of quasiconvexity for radially semicontinuous mappings defined on a convex subset of a real linear space. As an application we obtain an extension of the Sion's minimax theorem, as well as a new…
We define convexity canonically in the setting of monoids. We show that many classical results from convex analysis hold for functions defined on such groups and semigroups, rather than only on vector spaces. Some examples and…