Related papers: Spectrahedral Containment and Operator Systems wit…
Advancements in the synthesis of faceted nanoparticles and colloids have spurred interest in the phase behavior of polyhedral shapes. Regular tetrahedra have attracted particular attention because they prefer local symmetries that are…
Spherical confinement in 3D harmonic, quartic and other higher oscillators of even order is studied. The generalized pseudospectral method is employed for accurate solution of relevant Schr\"odinger equation in an \emph{optimum,…
Sufficiently accurate finite state models, also called symbolic models or discrete abstractions, allow one to apply fully automated methods, originally developed for purely discrete systems, to formally reason about continuous and hybrid…
A new approach for decoding binary linear codes by solving a linear program (LP) over a relaxed codeword polytope was recently proposed by Feldman et al. In this paper we investigate the structure of the polytope used in the LP relaxation…
In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in $\mathbb{R}^3$ up to similarity…
In this paper, we study the stability of the inverse conductivity problem of determining a convex polyhedral inclusion embedded in a homogeneous isotropic medium from a single boundary measurement. The main tools in our analysis are…
Optimization under structural constraints is typically analyzed through projection or penalty methods, obscuring the geometric mechanism by which constraints shape admissible dynamics. We propose an operator-theoretic formulation in which…
Our focus is on robust recovery algorithms in statistical linear inverse problem. We consider two recovery routines - the much studied linear estimate originating from Kuks and Olman [42] and polyhedral estimate introduced in [37]. It was…
In this paper, we study the set $\mathcal{S}^\kappa = \{ (x,y)\in\mathcal{G}\times\mathbb{R}^n : y_j = x_j^\kappa , j=1,\dots,n\}$, where $\kappa > 1$ and the ground set $\mathcal{G}$ is a nonempty polytope contained in $[0,1]^n$. This…
This thesis explores algorithmic applications and limitations of convex relaxation hierarchies for approximating some discrete and continuous optimization problems. - We show a dichotomy of approximability of constraint satisfaction…
We prove in this paper the weak consistency of a general finite volume convection operator acting on discrete functions which are possibly not piecewise-constant over the cells of the mesh and over the time steps. It yields an extension of…
This paper addresses formation control of reduced attitudes in which a continuous control protocol is proposed for achieving and stabilizing all regular polyhedra (also known as Platonic solids) under a unified framework. The protocol…
We adopt an operator-theoretic perspective to analyze a class of nonlinear fixed-point iterations and discrete-time dynamical systems. Specifically, we study the Krasnoselskij iteration - at the heart of countless algorithmic schemes and…
In this work we explore the fidelity of numerical approximations to the analytic spectra of hyperbolic partial differential equation systems with variable coefficients. We are particularly interested in the ability of discrete methods to…
We investigate finite-dimensional constrained structured optimization problems, featuring composite objective functions and set-membership constraints. Offering an expressive yet simple language, this problem class provides a modeling…
A polyhedral convex set optimization problem is given by a set-valued objective mapping from the $n$-dimensional to the $q$-dimensional Euclidean space whose graph is a convex polyhedron. This problem can be seen as the most elementary…
Conforti et al. give a compact extended formulation for a class of bimodular-constrained integer programs, namely those that model the stable set polytope of a graph with no disjoint odd cycles. We extend their techniques to design compact…
Context: The technique of disentangling has been applied to numerous high-precision studies of spectroscopic binaries and multiple stars. Although, its possibilities have not yet been fully understood and exploited. Aims: Theoretical…
State-of-the-art methods in convex and non-convex optimization employ higher-order derivative information, either implicitly or explicitly. We explore the limitations of higher-order optimization and prove that even for convex optimization,…
In many applications, thin shell-like structures are integrated within or attached to volumetric bodies. This includes reinforcements placed in soft matrix material in lightweight structure design, or hollow structures that are partially or…