Related papers: Reconstruction of Centrally Symmetrical Convex Bod…
In parallel magnetic resonance imaging (pMRI), to find a joint solution for the image and coil sensitivity functions is a nonlinear and nonconvex problem. A class of algorithms reconstruct sensitivity encoded images of the coils first…
We introduce complex intersection bodies and show that their properties and applications are similar to those of their real counterparts. In particular, we generalize Busemann's theorem to the complex case by proving that complex…
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…
Tomographic image reconstruction can be mapped to a problem of finding solutions to a large system of linear equations which maximize a function that includes \textit{a priori} knowledge regarding features of typical images such as…
Modern deep learning reconstruction algorithms generate impressively realistic scans from sparse inputs, but can often produce significant inaccuracies. This makes it difficult to provide statistically guaranteed claims about the true state…
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…
In this paper, we introduce a definition of discrete conformality for triangulated surfaces with flat cone metrics and describe an algorithm for solving the problem of prescribing curvature, that is to deform the metric discrete conformally…
We prove that any four-body convex central configuration with perpendicular diagonals must be a kite configuration. The result extends to general power-law potential functions, including the planar four-vortex problem.
By adapting the test functions introduced by Choi-Daskaspoulos \cite{c-d} and Brendle-Choi-Daskaspoulos \cite{b-c-d} and exploring properties of the $k$-th elementary symmetric functions $\sigma_{k}$ intensively, we show that for any fixed…
In this paper we prove different functional inequalities extending the classical Rogers-Shephard inequalities for convex bodies. The original inequalities provide an optimal relation between the volume of a convex body and the volume of…
In this paper, we study the Dirichlet problem for $p$-convex hypersurfaces with prescribed curvature. We prove that there exists a graphic hypersurface satisfying the prescribed curvature equation with homogeneous boundary condition. An…
English: This paper concerns the image reconstruction from a few projections in Computed Tomography (CT). The main objective of this paper is to show that the problem is so ill posed that no classical method, such as analytical methods…
We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…
This paper considers projection and convolution operations for integrally convex functions, which constitute a fundamental function class in discrete convex analysis. It is shown that the class of integrally convex functions is stable under…
In this paper we study how certain symmetries of convex bodies affect their geometric properties. In particular, we consider the impact of symmetries generated by the block diagonal subgroup of orthogonal transformations, generalizing…
The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilising the…
This paper is a continuation of Part I where the general setup was developed. Here we discuss the general equivalence problem for geometric structures and provide criteria for the equivalence, local and global, of transitive structures.…
In this work, we provide a local classification of certain special classes of surfaces determined by the prescription of the radial mean curvature in terms of the height and angle functions. Moreover, we introduce a special class of…
In this paper, we propose two algorithms for solving convex optimization problems with linear ascending constraints. When the objective function is separable, we propose a dual method which terminates in a finite number of iterations. In…
In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…