Related papers: Learning polytopes with fixed facet directions
It is known that the common factors in a large panel of data can be consistently estimated by the method of principal components, and principal components can be constructed by iterative least squares regressions. Replacing least squares…
Generally, the normal displacement-based formation control has a sensing mode that requires the agent not only to have certain knowledge of its direction, but also to gather its local information characterized by nonnegative coupling…
The problem of recovering the parameters of a mixture of spike signals convolved with different PSFs is considered. Herein, the spike support is assumed to be known, while the PSFs lie on a manifold. A non-linear least squares estimator of…
In recent years it was proved that simple modifications of the classical Frank-Wolfe algorithm (aka conditional gradient algorithm) for smooth convex minimization over convex and compact polytopes, converge with linear rate, assuming the…
In this paper, we study the mixed-integer nonlinear set given by a separable quadratic constraint on continuous variables, where each continuous variable is controlled by an additional indicator. This set occurs pervasively in optimization…
In this paper we propose a method for the approximation of high-dimensional functions over finite intervals with respect to complete orthonormal systems of polynomials. An important tool for this is the multivariate classical analysis of…
We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…
In this paper, we consider a modified projected Gauss-Newton method for solving constrained nonlinear least-squares problems. We assume that the functional constraints are smooth and the the other constraints are represented by a simple…
This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…
We present new large-scale algorithms for fitting a subgradient regularized multivariate convex regression function to $n$ samples in $d$ dimensions -- a key problem in shape constrained nonparametric regression with applications in…
We investigate algorithms for reconstructing a convex body $K$ in $\mathbb {R}^n$ from noisy measurements of its support function or its brightness function in $k$ directions $u_1,...,u_k$. The key idea of these algorithms is to construct a…
Today, three-dimensional reconstruction of objects has many applications in various fields, and therefore, choosing a suitable method for high resolution three-dimensional reconstruction is an important issue and displaying high-level…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
It is not surprising that one should expect that the degree of constrained (shape preserving) approximation be worse than the degree of unconstrained approximation. However, it turns out that, in certain cases, these degrees are the same.…
Recently, several works have shown that natural modifications of the classical conditional gradient method (aka Frank-Wolfe algorithm) for constrained convex optimization, provably converge with a linear rate when: i) the feasible set is a…
This paper concerns time-harmonic inverse source problems with a single far-field pattern in two dimensions, where the source term is compactly supported in an a priori given inhomogeneous background medium. For convex-polygonal source…
We derive computationally tractable formulations of the robust counterparts of convex quadratic and conic quadratic constraints that are concave in matrix-valued uncertain parameters. We do this for a broad range of uncertainty sets. In…
The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a…
This paper presents algorithms for computing the Groebner fan of an arbitrary polynomial ideal. The computation involves enumeration of all reduced Groebner bases of the ideal. Our algorithms are based on a uniform definition of the…
X-ray tomographic image reconstruction consists of determining an object function from its projections. In many applications such as non-destructive testing, we look for a fault region (air) in a homogeneous, known background (metal). The…