Related papers: On the nontrivial projection problem

The complex Busemann-Petty problem asks whether origin symmetric convex bodies in $\C^n$ with smaller central hyperplane sections necessarily have smaller volume. We prove that the answer is affirmative if $n\le 3$ and negative if $n\ge 4.$

The structured low-rank approximation problem for general affine structures, weighted 2-norms and fixed elements is considered. The variable projection principle is used to reduce the dimensionality of the optimization problem. Algorithms…

The article studies a generalization of the classical Fermat-Torricelli problem to normed spaces of arbitrary finite dimension. Necessary and sufficient conditions for the uniqueness of the solution of the Fermat-Torricelli problem for any…

The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on…

Optimization problems with rank constraints arise in many applications, including matrix regression, structured PCA, matrix completion and matrix decomposition problems. An attractive heuristic for solving such problems is to factorize the…

The generalized Busemann-Petty problem asks whether centrally-symmetric convex bodies having larger volume of all m-dimensional sections necessarily have larger volume. When m>3 this is known to be false, but the cases m=2,3 are still open.…

The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions -- computing the size of projections of high dimensional polytopes…

In this paper, we studied the equilibrium problem where the bi-function may be quasiconvex with respect to the second variable and the feasible set is the intersection of a finite number of convex sets. We propose a projection-algorithm,…

Given an affine variety X and a finite dimensional vector space of regular functions L on X, we associate a convex body to (X, L) such that its volume is responsible for the number of solutions of a generic system of functions from L. This…

Generalized entropic projections and dominating points are solutions to convex minimization problems related to conditional laws of large numbers. They appear in many areas of applied mathematics such as statistical physics, information…

We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…

We consider several classes of highly important semidefinite optimization problems that involve both a convex objective function (smooth or nonsmooth) and additional linear or nonlinear smooth and convex constraints, which are ubiquitous in…

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…

We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…

In this note we show how to construct a number of nonconvex quadratic inequalities for a variety of physics equations appearing in physical design problems. These nonconvex quadratic inequalities can then be used to construct bounds on…

Self-concordance is the most important property required for barriers in convex programming. It is intrinsically linked to the affine structure of the underlying space. Here we introduce an alternative notion of self-concordance which is…

Minkowski's Theorem asserts that every centered measure on the sphere which is not concentrated on a great subsphere is the surface area measure of some convex body, and, moreover, the surface area measure determines a convex body uniquely.…

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

Abstract In this paper, we study affine bodies of revolution. This will allow us to prove that a convex body all whose orthogonal $n$-projections are affinely equivalent is an ellipsoid, provided $n\equiv 0,1, 2$ mod $4$, $n>1$ with the…

A new exact projective penalty method is proposed for the equivalent reduction of constrained optimization problems to nonsmooth unconstrained ones. In the method, the original objective function is extended to infeasible points by summing…