Related papers: How to project onto SL($n$)
We provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…
Given a compact semialgebraic set S of R^n and a polynomial map f from R^n to R^m, we consider the problem of approximating the image set F = f(S) in R^m. This includes in particular the projection of S on R^m for n greater than m. Assuming…
We develop \emph{geometric optimisation} on the manifold of Hermitian positive definite (HPD) matrices. In particular, we consider optimising two types of cost functions: (i) geodesically convex (g-convex); and (ii) log-nonexpansive (LN).…
In this paper, we propose a novel primal-dual inexact gradient projection method for nonlinear optimization problems with convex-set constraint. This method only needs inexact computation of the projections onto the convex set for each…
By a further study of the mechanism of the hyperbolic regularization of the moment system for Boltzmann equation proposed in [Z. Cai, Y. Fan, R. Li, Comm. Math. Sci. 11(2): 547-571, 2013], we point out that the key point is treating the…
Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…
In this work a linearly constrained minimization of a positive semidefinite quadratic functional is examined. Our results are concerning infinite dimensional real Hilbert spaces, with a singular positive operator related to the functional,…
In this paper, we study a class of approximation problems, appearing in data approximation and signal processing. The approximations are constructed as combinations of polynomial splines (piecewise polynomials), whose parameters are subject…
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its eigenvector. The problem arises in the decomposition of a…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
We investigate how to solve smooth matrix optimization problems with general linear inequality constraints on the eigenvalues of a symmetric matrix. We present solution methods to obtain exact global minima for linear objective functions,…
It is an open problem to determine the dimension of the space of homogeneous polynomials of a fixed degree vanishing at finitely many points in the projective plane to certain multiplicities. We present various aspects of this problem and a…
For a parameterized hyperbolic system $u_{i+1} = f(u_i,s)$, the derivative of an ergodic average $\ < J\ > = \underset{n\rightarrow\infty}{\lim} \frac1n \sum_1^n J(u_i,s)$ to the parameter $s$ can be computed via the least squares…
Let $k$ and $i_1,\ldots,i_n$ be natural numbers. Place $k$ balls into a multidimensional box of $i_1\times\cdots \times i_n$ cells, no more than one ball to each cell, such that the projections to each of the coordinate axes have…
We propose a new algorithm for the optimization of convex functions over a polyhedral set in Rn. The algorithm extends the spectral projected-gradient method with limited-memory BFGS iterates restricted to the present face whenever…
Projecting a vector onto a simplex is a well-studied problem that arises in a wide range of optimization problems. Numerous algorithms have been proposed for determining the projection; however, the primary focus of the literature has been…
We solve the problem of best approximation by Parseval frames to an arbitrary frame in a subspace of an infinite dimensional Hilbert space. We explicitly describe all the solutions and we give a criterion for uniqueness. This best…
The projection onto the epigraph or a level set of a closed proper convex function can be achieved by finding a root of a scalar equation that involves the proximal operator as a function of the proximal parameter. This paper develops the…
While the angular-momentum projection is a common tool for theoretical nuclear structure studies, a large amount of computations are required particularly for triaxially deformed states. In the present work, we clarify the conditions of the…
We prove that for any real-valued matrix $X \in \R^{m \times n}$, and positive integers $r \ge k$, there is a subset of $r$ columns of $X$ such that projecting $X$ onto their span gives a $\sqrt{\frac{r+1}{r-k+1}}$-approximation to best…