Related papers: Existence in Multidimensional Screening with Gener…
We study the following problem in computer vision from the perspective of algebraic geometry: Using $m$ pinhole cameras we take $m$ pictures of a line in $\mathbb P^3$. This produces $m$ lines in $\mathbb P^2$ and the question is which…
The multi-objective optimization is to optimize several objective functions over a common feasible set. Since the objectives usually do not share a common optimizer, people often consider (weakly) Pareto points. This paper studies…
Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…
In this article we introduce generalized projective spaces (Definitions $[2.1, 2.5]$) and prove three main theorems in two different contexts. In the first context we prove, in main Theorem $A$, the surjectivity of the Chinese remainder…
The paper is concerned with the problem of shape preserving interpolatory subdivision. For arbitrarily spaced, planar input data an efficient non-linear subdivision algorithm is presented that results in $G^1$ limit curves, reproduces conic…
Nonparametric generalized likelihood ratio test is popularly used for model checking for regressions. However, there are two issues that may be the barriers for its powerfulness. First, the bias term in its liming null distribution causes…
Let us consider the autonomous obstacle problem \begin{equation*} \min_v \int_\Omega F(Dv(x)) \, dx \end{equation*} on a specific class of admissible functions, where we suppose the Lagrangian satisfies proper hypotheses of convexity and…
We consider the problem of minimizing a block separable convex function (possibly nondifferentiable, and including constraints) plus Laplacian regularization, a problem that arises in applications including model fitting, regularizing…
We establish a result which states that regularizing an inverse problem with the gauge of a convex set $C$ yields solutions which are linear combinations of a few extreme points or elements of the extreme rays of $C$. These can be…
This paper proposes two linear projection methods for supervised dimension reduction using only the first and second-order statistics. The methods, each catering to a different parameter regime, are derived under the general Gaussian model…
A linear quadratic Dirichlet control problem posed on a possibly non-convex polygonal domain is analyzed. Detailed regularity results are provided in classical Sobolev (Slobodetskii) spaces. In particular, it is proved that in the presence…
Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…
The optimization problem behind neural networks is highly non-convex. Training with stochastic gradient descent and variants requires careful parameter tuning and provides no guarantee to achieve the global optimum. In contrast we show…
We introduce the problem of $k$-chasing of convex functions, a simultaneous generalization of both the famous k-server problem in $R^d$, and of the problem of chasing convex bodies and functions. Aside from fundamental interest in this…
We consider a multi-block separable convex optimization problem with the linear constraints, where the objective function is the sum of m individual convex functions without overlapping variables. The linearized version of the generalized…
The adaptive BDDC method is extended to the selection of face constraints in three dimensions. A new implementation of the BDDC method is presented based on a global formulation without an explicit coarse problem, with massive parallelism…
We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints, under which the convex hull of the rank-1 set is polyhedral…
We show that a special class of (nonconvex) NMPC problems admits an exact solution by reformulating them as a finite number of convex subproblems, extending previous results to the multi-input case. Our approach is applicable to a special…
We survey some known facts and open questions concerning the global properties of 3+1 dimensional spacetimes containing a compact Cauchy surface. We consider spacetimes with an $\ell$-dimensional Lie algebra of space-like Killing fields.…
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.