Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
0 answers
41 views

Iterative algorithm for obtaining similarity

Let $x_1,x_2,\ldots,x_M$ be $M$ non-negative variables. Moreover, assume that $f_m(x_m)=\frac{x_m}{1+\sum_{n}\beta_{n}^{(m)}x_n}$ be $M$ fractional functions with non-negative constants $\beta_{n}^{(m)...
Math_Y's user avatar
  • 287
4 votes
2 answers
734 views

Fast projection onto a subspace

Given an $n$-dimensional vector $\mathbf{c}\in [0,1]^n$, let $\Delta_{\mathbf{c}}$ be the set of points $\{\mathbf{x}\in [0,1]^n: \langle \mathbf{c},\mathbf{x} \rangle \le 1\}$, where $\langle \mathbf{...
Penelope Benenati's user avatar
0 votes
1 answer
917 views

What is the most accurate and efficient method of finding an inverse of a hessian matrix?

For any hessian matrix, of say 300 by 300, and may or may not necessarily be positive semi-definite, thus algorithms such as Cholesky decomposition may not be used. I've found that some algorithms ...
Mike Chen's user avatar